Sciweavers

1518 search results - page 39 / 304
» Exact and Approximate Bandwidth
Sort
View
JAL
2007
95views more  JAL 2007»
13 years 9 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...
SISAP
2008
IEEE
130views Data Mining» more  SISAP 2008»
14 years 4 months ago
The Many Facets of Approximate Similarity Search
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
Marco Patella, Paolo Ciaccia
DAM
1999
169views more  DAM 1999»
13 years 9 months ago
Approximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
Guy Kortsarz, David Peleg
ACL
1998
13 years 11 months ago
Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation i...
Mark Johnson
KR
2000
Springer
14 years 1 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy