Sciweavers

9719 search results - page 250 / 1944
» Answer Set Optimization
Sort
View
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
16 years 8 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi
WWW
2008
ACM
16 years 7 months ago
Efficient vectorial operators for processing xml twig queries
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin...
ICASSP
2008
IEEE
16 years 1 months ago
Extracting question/answer pairs in multi-party meetings
Understanding multi-party meetings involves tasks such as dialog act segmentation and tagging, action item extraction, and summarization. In this paper we introduce a new task for...
Andreas Kathol, Gökhan Tür
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
16 years 5 days ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
SSD
2001
Springer
119views Database» more  SSD 2001»
15 years 11 months ago
Constrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
Hakan Ferhatosmanoglu, Ioana Stanoi, Divyakant Agr...