- Cleaning Search Results using Term Distance Features Josh Attenberg Torsten Suel
- Lower Bounds for Shellsort C. Greg Plaxton
- Improving Web Spam Classifiers Using Link Structure Qingqing Gan and Torsten Suel
- Interactive Wrapper Generation with Minimal User Effort CIS Department
- Compressing the Graph Structure of the Web Torsten Suel Jun Yuan
- Approximation Algorithms for Array Partitioning Problems S. Muthukrishnan
- processor. Using simple geometric arguments, it can be shown that all of these elements reach their destination row in time.
- Improved Index Compression Techniques for Versioned Document Collections
- Improved Techniques for Result Caching in Web Search Engines
- Efficient Communication Using TotalExchange NEC Research Institute
- Hierarchical Substring Caching for Efficient Content Distribution to Low-Bandwidth Clients
- Server-Friendly Delta Compression for Efficient Web Access Anubhav Savant Torsten Suel
- Compact Grid Layouts of Multi-Level Networks S. Muthukrishnan y Mike Paterson z Suleyman Cenk S.ahinalp x Torsten Suel {
- Algorithms for Low-Latency Remote File Synchronization CIS Department
- Geographic Web Usage Estimation By Monitoring DNS Huseyin Akcan
- Modeling and Predicting User Behavior in Sponsored Josh Attenberg Sandeep Pandey Torsten Suel
- Derandomizing Algorithms for Routing and Sorting on Meshes Michael Kaufmann Jop F. Sibeyny Torsten Suelz
- ON THE SCALABILITY OF AN IMAGE TRANSCODING PROXY SERVER Anubhav Savant, Nasir Memon, Torsten Suel
- On Randomized and Deterministic Schemes for Routing and Sorting
- Optimal Histograms with Quality Guarantees H. V. Jagadish
- Efficient Query Processing in Geographic Web Search Engines
- Compressing File Collections with a TSP-Based Dimitre Trendafilov Nasir Memon Torsten Suel
- ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval
- On Rectangular Partitionings in Two Dimensions
- wang-50214 wangfm August 23, 2001 14:22 In the past decade or so, there have been fascinating developments in multimedia rep-
- Compact Grid Layouts of MultiLevel Networks \Lambda S. Muthukrishnan y Mike Paterson z Suleyman Cenk S . ahinalp x Torsten Suel --
- Scalable Techniques for Document Identifier Assignment in Inverted Indexes
- Compact Full-Text Indexing of Versioned Document Collections
- Compressing Term Positions in Web Indexes CSE Department
- Inverted Index Compression and Query Processing with Optimized Document Ordering
- Performance of Compressed Inverted List Caching in Search Engines
- Efficient Search in Large Textual Collections with Redundancy
- Optimized Inverted List Assignment in Distributed Search Engine Architectures
- Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment
- Three-Level Caching for Efficient Query Processing in Large Web Search Engines
- ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval
- Cluster-Based Delta Compression of a Collection of Files Zan Ouyang Nasir Memon Torsten Suel Dimitre Trendafilov
- zdelta: An Efficient Delta Compression Tool Dimitre Trendafilov Nasir Memon Torsten Suel
- Algorithms for Delta Compression and Remote File Synchronization
- Design and Implementation of a High-Performance Distributed Web Crawler
- Compressing the Graph Structure of the Web Torsten Suel
- Scalable Sweeping-Based Spatial Join Lars Arge Octavian Procopiucy
- Theory and Practice of I/O-E cient Algorithms for Multidimensional Batched Searching Problems
- BSPlib: The BSP Programming Library Jonathan M. D. Hill
- Portable and E cient Parallel Computing Using the BSP Model
- On Randomized and Deterministic Schemes for Routing and Sorting
- Lower Bounds for Sorting Networks Nabil Kahale1;2 Tom Leighton3 Yuan Ma1;4
- Parallel Processing Letters c World Scienti c Publishing Company
- A Lower Bound for Sorting Networks Based on the Shu e Permutation
- Ultrasound Imaging Polytechnic University, Brooklyn, NY 11201
- [22] K. E. Schmidt and M. A. Lee. Implementing the fast multipole method in three dimensions. Journal of Statistical Physics, 63:1223--1235, 1991.
- A SuperLogarithmic Lower Bound for Hypercubic Sorting Networks
- Derandomizing Algorithms for Routing and Sorting on Meshes Michael Kaufmann \Lambda Jop F. Sibeyn y Torsten Suel z
- Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes
- Optimized Query Execution in Large Search Engines with Global Page Ordering
- Torsten Suel Routing and Sorting on Fixed Topologies
- Scalable SweepingBased Spatial Join Lars Arge \Lambda Octavian Procopiuc y Sridhar Ramaswamy z
- Lower Bounds for Shellsort \Lambda C. Greg Plaxton y Torsten Suel z
- A Unified Approach For Indexed and Non-Indexed Spatial Joins
- processor. Using simple geometric arguments, it can be shown that all of these elements reach their destination row in time.
- Design and Implementation of a HighPerformance Distributed Web Crawler
- On Rectangular Partitionings in Two Dimensions
- Theory and Practice of I/OEfficient Algorithms for Multidimensional Batched Searching Problems
- Beyond the WorstCase Bisection Bound: Fast Sorting and Ranking on Meshes ?
- Routing and Sorting on Meshes with Row and Column Buses
- Contextual Ranking of Keywords Using Click Data Utku Irmak #1
- Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment
- ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval
- Improved Bounds for Routing and Sorting on MultiDimensional Meshes
- SecondOrder Methods for Distributed Approximate Single and Multicommodity Flow
- A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks
- Physics of MRI Polytechnic University, Brooklyn, NY 11201
- Lower Bounds for Sorting Networks Nabil Kahale 1;2 Tom Leighton 3 Yuan Ma 1;4
- Algorithms for Low-Latency Remote File Synchronization CIS Department
- Compressing File Collections with a TSP-Based Dimitre Trendafilov Nasir Memon Torsten Suel
- MRI Instrumentation and Pulse Sequences
- (a) Introduction: What is IR? (b) Historical development of IR
- Nuclide Imaging: Planar Scintigraphy, SPECT, PET
- Towards Efficiency and Portability: Programming with the BSP Model
- BSPlib: The BSP Programming Library Jonathan M. D. Hill a Bill McColl a Dan C. Stefanescu b;c
- Compressing Term Positions in Web Indexes CSE Department
- Design and Implementation of a Geographic Search Engine Alexander Markowetz
- Towards Efficiency and Portability: Programming with the BSP Model
- Leveraging Context in User-Centric Entity Detection Vadim von Brzeski
- On Probabilistic Networks for Selection, Merging, and Sorting
- [22] K. E. Schmidt and M. A. Lee. Implementing the fast multipole method in three dimensions. Journal of Statistical Physics, 63:12231235, 1991.
- Computed Tomography Polytechnic University, Brooklyn, NY 11201
- Local Methods for Estimating PageRank Values Yen-Yu Chen Qingqing Gan Torsten Suel
- Jointly published by Akadmiai Kiad, Budapest Scientometrics, and Kluwer Academic Publishers, Dordrecht Vol. 54, No. 1 (2002) 145154
- Design and Implementation of a Geographic Search Engine
- Robots & Spiders & Crawlers: How Web and intranet search engines
- Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks
- NEXT TOPIC: Advanced Query Processing and
- Introduction, Review of Signals & Systems, Image
- Functional MRI Polytechnic Institute of NYU, Brooklyn, NY 11201
- VIDEO PROCESSING AND COMMUNICATIONS Yao Wang, Joern Ostermann, and Ya-Qin Zhang
- I/O-Efficient Techniques for Computing Pagerank Yen-Yu Chen Qingqing Gan Torsten Suel
- Parallel Processing Letters fl World Scientific Publishing Company
- A Unified Approach For Indexed and NonIndexed Spatial Joins
- Routing and Sorting on Meshes with Row and Column Buses
- E cient Communication Using Total-Exchange NEC Research Institute
- Using Graphics Processors for High Performance IR Query Processing
- Performance of Compressed Inverted List Caching in Search Engines
- Analysis of Geographic Queries in a Search Engine Log Qingqing Gan Josh Attenberg Alexander Markowetz Torsten Suel
- Second-Order Methods for Distributed Approximate Single-and Multicommodity Flow
- A Super-Logarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks 1
- Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes?
- I/O-Efficient Techniques for Computing Pagerank Yen-Yu Chen Qingqing Gan Torsten Suel
- Efficient Term Proximity Search with Term-Pair Indexes , Shuming Shi2
- wang-50214 wangfm August 23, 2001 14:22 PREFACE xxi
- Physics of Ultrasound Polytechnic University, Brooklyn, NY 11201
- Physics of Nuclear Medicine Polytechnic Institute of NYU, Brooklyn, NY 11201
- Computed Tomography Polytechnic University, Brooklyn, NY 11201
- Projection Radiography Polytechnic University, Brooklyn, NY 11201
- Basically, to process a query we need to traverse the inverted lists of the query terms
- Efficient Search in Large Textual Collections with Redundancy
- A Scalable Machine-Learning Approach for Semi-Structured Named Entity Recognition
- Physics of Radiography Polytechnic University, Brooklyn, NY 11201
- Batch Query Processing for Web Search Engines Polytechnic Institute of NYU
- Faster Temporal Range Queries over Versioned Text CSE Department
- Scalable Manipulation of Archival Web Graphs Yasemin Avcular
- Text vs. Space: Efficient Geo-Search Query Processing Maria Christoforaki
