210 search results - page 37 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
CIKM
2004
Springer
14 years 26 days ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
CDES
2008
13 years 9 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
ESORICS
2007
Springer
14 years 1 months ago
2007
Springer
The problem of key management in access hierarchies studies ways to assign keys to users and classes such that each user, after receiving her secret key(s), is able to independentl...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...