Sciweavers

1283 search results - page 131 / 257
» Probabilistic structured query methods
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 10 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
COMCOM
2004
127views more  COMCOM 2004»
13 years 9 months ago
Traffic splitting in a network: split traffic models and applications
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
Huei-Wen Ferng, Cheng-Ching Peng
ICRA
2009
IEEE
163views Robotics» more  ICRA 2009»
14 years 3 months ago
3D tree reconstruction from laser range data
— We present a method for reconstructing 3D models of tree branch structure from laser range data. Our approach is probabilistic, and uses a generative model of a tree to guide a...
Jonathan Binney, Gaurav S. Sukhatme
CIKM
2008
Springer
13 years 11 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra