789 search results - page 87 / 158 » On Theory Revision with Queries |
85
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
122
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
89
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
90
Voted
PODS
2007
ACM
16 years 28 days ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
93
Voted
EUROSEC
2010
ACM
15 years 7 months ago
2010
ACM
Fighting global security threats with only a local view is inherently difficult. Internet network operators need to fight global phenomena such as botnets, but they are hampered...