Sciweavers

3341 search results - page 71 / 669
» On Bounded Queries and Approximation
Sort
View
151
Voted
AAAI
2007
15 years 6 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
138
Voted
GEOINFORMATICA
1998
144views more  GEOINFORMATICA 1998»
15 years 3 months ago
Approximation-Based Similarity Search for 3-D Surface Segments
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
Hans-Peter Kriegel, Thomas Seidl
171
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Maximizing capacity with power control under physical interference model in duplex mode
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, ...
232
Voted
VLDB
2007
ACM
197views Database» more  VLDB 2007»
16 years 4 months ago
Indexable PLA for Efficient Similarity Search
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
Qiuxia Chen, Lei Chen 0002, Xiang Lian, Yunhao Liu...
161
Voted
AMW
2009
15 years 4 months ago
Data Expiration and Aggregate Queries
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
David Toman