Sciweavers

14548 search results - page 2460 / 2910
» The Optimal Path-Matching Problem
Sort
View
272
Voted
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 7 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
309
Voted
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 7 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
212
Voted
PERCOM
2007
ACM
16 years 6 months ago
Context Aware Routing of Enterprise User Communications
This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locatio...
Munmun De Choudhury, Hari Sundaram, Ajita John, Do...
164
Voted
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 4 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
« Prev « First page 2460 / 2910 Last » Next »