Sciweavers

1632 search results - page 20 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
ICDE
2012
IEEE
228views Database» more  ICDE 2012»
13 years 5 months ago
A General Method for Estimating Correlated Aggregates over a Data Stream
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
Srikanta Tirthapura, David P. Woodruff
ISBI
2007
IEEE
15 years 9 months ago
Space-Time Sparsity Regularization for the Magnetoencephalography Inverse Problem
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
Andrew K. Bolstad, Barry D. Van Veen, Robert D. No...
ADHOCNOW
2003
Springer
15 years 8 months ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
ICRA
2006
IEEE
115views Robotics» more  ICRA 2006»
15 years 9 months ago
Path Planning above a Polyhedral Terrain
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
Hamid Zarrabi-Zadeh
CVPR
2010
IEEE
15 years 3 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...