Sciweavers

6365 search results - page 839 / 1273
» Fast Local Computation Algorithms
Sort
View
CORR
2008
Springer
234views Education» more  CORR 2008»
15 years 7 months ago
Bayesian Compressive Sensing via Belief Propagation
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
Dror Baron, Shriram Sarvotham, Richard G. Baraniuk
IJRR
2008
242views more  IJRR 2008»
15 years 7 months ago
Bilateral Symmetry Detection for Real-time Robotics Applications
Bilateral symmetry is a salient visual feature of many man-made objects. In this paper, we present research that use bilateral symmetry to identify, segment and track objects in re...
Wai Ho Li, Alan M. Zhang, Lindsay Kleeman
JCP
2008
87views more  JCP 2008»
15 years 7 months ago
VLSI Architecture of a Cellular Automata based One-Way Function
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
Debdeep Mukhopadhyay, Pallavi Joshi, Dipanwita Roy...
JMMA
2002
90views more  JMMA 2002»
15 years 7 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
SAC
2002
ACM
15 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...