3341 search results - page 97 / 669 » On Bounded Queries and Approximation |
NIPS
2007
14 years 11 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
PODS
2000
ACM
15 years 2 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
ICALP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
SAGA
2007
Springer
15 years 4 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...