Sciweavers

680 search results - page 68 / 136
» From Structured Documents to Novel Query Facilities
Sort
View
EUSAI
2004
Springer
15 years 11 months ago
Context-Aware, Ontology-Based Service Discovery
Service discovery is a process of locating, or discovering, one or more documents, that describe a particular service. Most of the current service discovery approaches perform synt...
Tom Broens, Stanislav Pokraev, Marten van Sinderen...
GIR
2006
ACM
16 years 7 days ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 8 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
SIGIR
2004
ACM
15 years 11 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 11 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...