387 search results - page 51 / 78 » Reasoning About Approximate Match Query Results |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Workload management for business intelligence (BI) queries poses different challenges than those addressed in the online transaction processing (OLTP) context. The fundamental pro...
ISM
2008
IEEE
14 years 3 months ago
2008
IEEE
In the recent years, photo context metadata (e.g., date, GPS coordinates) have been proved to be useful in the management of personal photos. However, these metadata are still poo...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...