3368 search results - page 148 / 674 » The Complexity of Query Reliability |
108
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...
118
click to vote
DASFAA
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
107
click to vote
FOCS
1993
IEEE
15 years 6 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
137
click to vote
VLDB
1991
ACM
15 years 6 months ago
1991
ACM
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
126
click to vote
ECCC
2008
15 years 2 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...