Sciweavers

2642 search results - page 295 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 4 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
EDBT
2008
ACM
160views Database» more  EDBT 2008»
16 years 4 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
15 years 10 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
EUROPAR
2007
Springer
15 years 10 months ago
Asynchronous Distributed Power Iteration with Gossip-Based Normalization
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, im...
Márk Jelasity, Geoffrey Canright, Kenth Eng...
158
Voted
ICAC
2006
IEEE
15 years 10 months ago
Fast and Effective Worm Fingerprinting via Machine Learning
— As Internet worms become ever faster and more sophisticated, it is important to be able to extract worm signatures in an accurate and timely manner. In this paper, we apply mac...
Stewart M. Yang, Jianping Song, Harish Rajamani, T...