Sciweavers

705 search results - page 42 / 141
» Approximating Extended Answer Sets
Sort
View
113
Voted
CSE
2009
IEEE
15 years 8 months ago
Processing Approximate Moving Range Queries in Mobile Sensor Environments
— The ubiquity of mobile devices has led to a rising demand for location-based services and applications. A major part of these services is based on the location-detection capabi...
Antoniya Petkova, Kien A. Hua, Alexander J. Aved
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 9 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 3 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 7 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
128
Voted
SWAP
2008
15 years 4 months ago
A Note on the Evaluation of Inductive Concept Classification Procedures
Abstract. The limitations of deductive logic-based approaches at deriving operational knowledge from ontologies may be overcome by inductive (instancebased) methods, which are usua...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito