Sciweavers

923 search results - page 133 / 185
» On the Topology of Discrete Strategies
Sort
View
CVPR
1998
IEEE
14 years 11 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
GPEM
2008
128views more  GPEM 2008»
13 years 9 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
TSP
2008
151views more  TSP 2008»
13 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
SIAMNUM
2011
144views more  SIAMNUM 2011»
13 years 4 months ago
Continuous Mesh Framework Part II: Validations and Applications
This paper gives a numerical validation of the continuous mesh framework introduced in Part I [23]. We numerically show that the interpolation error can be evaluated analytically o...
Adrien Loseille, Frédéric Alauzet
INFOCOM
1999
IEEE
14 years 1 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek