Sciweavers

172 search results - page 18 / 35
» On the cost of searching signature trees
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Opportunistic Processing and Query of Motion Trajectories in Wireless Sensor Networks
—We study the problem of in-network processing and queries of trajectories of moving targets in a sensor network. The main idea is to exploit the spatial coherence of target traj...
Dengpan Zhou, Jie Gao
ATAL
2010
Springer
13 years 8 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 11 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
EPIA
2005
Springer
14 years 1 months ago
Adapting Peepholing to Regression Trees
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
Luís Torgo, Joana Marques
GLOBECOM
2006
IEEE
14 years 1 months ago
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
Guofeng Deng, Sandeep K. S. Gupta