1309 search results - page 229 / 262 » On-Line Difference Maximization |
125
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
208
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
205
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
151
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Main memory is a critical resource when processing longrunning queries over data streams with state intensive operators. In this work, we investigate state spill strategies that h...
177
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Wireless sensor networks have created new opportunities for data collection in a variety of scenarios, such as environmental and industrial, where we expect data to be temporally ...