Sciweavers

895 search results - page 167 / 179
» Using graphs for some discrete tomography problems
Sort
View
JAT
2010
109views more  JAT 2010»
13 years 5 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
JAIR
2006
179views more  JAIR 2006»
13 years 7 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
CVPR
2010
IEEE
13 years 7 months ago
Image atlas construction via intrinsic averaging on the manifold of images
In this paper, we propose a novel algorithm for computing an atlas from a collection of images. In the literature, atlases have almost always been computed as some types of means ...
Yuchen Xie, Jeffrey Ho, Baba C. Vemuri
ANOR
2005
102views more  ANOR 2005»
13 years 7 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 8 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee