Sciweavers

6274 search results - page 241 / 1255
» From query complexity to computational complexity
Sort
View
IPSN
2009
Springer
15 years 11 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 11 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
ESWS
2011
Springer
14 years 8 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
ISCAS
2007
IEEE
93views Hardware» more  ISCAS 2007»
15 years 11 months ago
High Speed Sphere Decoding Based on Vertically Incremental Computation
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
Se-Hyeon Kang, In-Cheol Park
AAAI
1990
15 years 6 months ago
A Design Based Approach to Constructing Computational Solutions to Diagnostic Problems
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
D. Volovik, Imran A. Zualkernan, Paul E. Johnson, ...