Sciweavers

310 search results - page 51 / 62
» Communication Efficient Distributed Mining of Association Ru...
Sort
View
CIKM
2005
Springer
15 years 5 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
137
Voted
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 12 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 15 days 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
99
Voted
DEBS
2008
ACM
15 years 2 months ago
Speculative out-of-order event processing with software transaction memory
In event stream applications, events flow through a network of components that perform various types of operations, e.g., filtering, aggregation, transformation. When the operatio...
Andrey Brito, Christof Fetzer, Heiko Sturzrehm, Pa...
103
Voted
WWW
2005
ACM
16 years 28 days ago
Application networking on peer-to-peer networks
This paper proposes the AN.P2P architecture to facilitate efficient peer-to-peer content delivery with heterogeneous presentation requirements. In general, the AN.P2P enables a pe...
Mu Su, Chi-Hung Chi