Sciweavers

4047 search results - page 774 / 810
» The Discrete Basis Problem
Sort
View
222
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 2 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
213
Voted
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 2 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
128
Voted
MOBIHOC
2005
ACM
16 years 2 months ago
The feasibility of launching and detecting jamming attacks in wireless networks
Wireless networks are built upon a shared medium that makes it easy for adversaries to launch jamming-style attacks. These attacks can be easily accomplished by an adversary emitt...
Wenyuan Xu, Wade Trappe, Yanyong Zhang, Timothy Wo...
110
Voted
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 11 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
151
Voted
ECIR
2009
Springer
15 years 11 months ago
Mean-Variance Analysis: A New Document Ranking Theory in Information Retrieval
Abstract. This paper concerns document ranking in information retrieval. In information retrieval systems, the widely accepted probability ranking principle (PRP) suggests that, fo...
Jun Wang