Sciweavers

1047 search results - page 79 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...
IJCV
2008
191views more  IJCV 2008»
13 years 7 months ago
Searching for Complex Human Activities with No Visual Examples
Abstract We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our ...
Nazli Ikizler, David A. Forsyth
CIKM
2006
Springer
13 years 11 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
AUSAI
2008
Springer
13 years 10 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
COMAD
2008
13 years 9 months ago
Discovering Interesting Subsets Using Statistical Analysis
In this paper we present algorithms for identifying interesting subsets of a given database of records. In many real life applications, it is important to automatically discover s...
Maitreya Natu, Girish Palshikar