Sciweavers

1982 search results - page 194 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
ATAL
2010
Springer
15 years 4 months ago
Exploiting scale invariant dynamics for efficient information propagation in large teams
Large heterogeneous teams will often be in situations where sensor data that is uncertain and conflicting is shared across a peer-to-peer network. Not every team member will have ...
Robin Glinton, Paul Scerri, Katia P. Sycara
151
Voted
EDBT
2010
ACM
206views Database» more  EDBT 2010»
15 years 10 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
167
Voted
ICC
2011
IEEE
237views Communications» more  ICC 2011»
14 years 3 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
139
Voted
ANCS
2006
ACM
15 years 9 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
122
Voted
CVPR
2004
IEEE
16 years 5 months ago
A Rao-Blackwellized Particle Filter for EigenTracking
Subspace representations have been a popular way to model appearance in computer vision. In Jepson and Black's influential paper on EigenTracking, they were successfully appl...
Zia Khan, Tucker R. Balch, Frank Dellaert