Sciweavers

685 search results - page 108 / 137
» Personalized Queries under a Generalized Preference Model
Sort
View
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
14 years 16 days ago
Automatic contention detection and amelioration for data-intensive operations
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
John Cieslewicz, Kenneth A. Ross, Kyoho Satsumi, Y...
CIKM
2008
Springer
13 years 9 months ago
SNIF TOOL: sniffing for patterns in continuous streams
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
Abhishek Mukherji, Elke A. Rundensteiner, David C....
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
MOBICOM
2004
ACM
14 years 1 months ago
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks
One key usage of VANET is to support vehicle safety applications. This use case is characterized by the prominence of broadcasts in scaled settings. In this context, we try to ans...
Marc Torrent-Moreno, Daniel Jiang, Hannes Hartenst...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie