2009 search results - page 81 / 402 » Dense Interest Points |
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
EWSN
2004
Springer
14 years 7 months ago
2004
Springer
Abstract. So-called "Smart Dust" is envisioned to combine sensing, computing, and wireless communication capabilities in an autonomous, dust-grain-sized device. Dense net...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
GLVLSI
2000
IEEE
14 years 14 days ago
2000
IEEE
— Typically, placement algorithms attempt to minimize the total net length of a printed circuit board (PCB). However, an MCM’s increased throughput and dense circuitry can easi...