Sciweavers

413 search results - page 42 / 83
» On space constrained set selection problems
Sort
View
TSMC
1998
82views more  TSMC 1998»
15 years 3 days ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
77
Voted
ISBI
2009
IEEE
15 years 7 months ago
Improving M/EEG Source Localization with an Inter-Condition Sparse Prior
The inverse problem with distributed dipoles models in M/EEG is strongly ill-posed requiring to set priors on the solution. Most common priors are based on a convenient ℓ2 norm....
Alexandre Gramfort, Matthieu Kowalski
127
Voted
JACM
2012
13 years 2 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
87
Voted
ISVD
2007
IEEE
15 years 6 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
DAWAK
1999
Springer
15 years 4 months ago
Dynamic Data Warehouse Design
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...
Dimitri Theodoratos, Timos K. Sellis