Sciweavers

217 search results - page 24 / 44
» On the Fine Structure of Large Search Spaces
Sort
View
DKE
1998
88views more  DKE 1998»
14 years 11 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
GIS
2010
ACM
14 years 10 months ago
Supporting location-based approximate-keyword queries
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...
Sattam Alsubaiee, Alexander Behm, Chen Li
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 2 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
ACL
2008
15 years 1 months ago
Bayesian Learning of Non-Compositional Phrases with Synchronous Parsing
We combine the strengths of Bayesian modeling and synchronous grammar in unsupervised learning of basic translation phrase pairs. The structured space of a synchronous grammar is ...
Hao Zhang, Chris Quirk, Robert C. Moore, Daniel Gi...
AUSAI
2008
Springer
15 years 1 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan