Sciweavers

3341 search results - page 359 / 669
» On Bounded Queries and Approximation
Sort
View
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
16 years 1 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
ESWS
2010
Springer
15 years 10 months ago
TrOWL: Tractable OWL 2 Reasoning Infrastructure
The Semantic Web movement has led to the publication of thousands of ontologies online. These ontologies present and mediate information and knowledge on the Semantic Web. Tools ex...
Edward Thomas, Jeff Z. Pan, Yuan Ren
PROCEDIA
2010
113views more  PROCEDIA 2010»
15 years 5 months ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
ISCI
2007
141views more  ISCI 2007»
15 years 6 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 4 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...