Sciweavers

1403 search results - page 270 / 281
» Set cover algorithms for very large datasets
Sort
View
ASPDAC
2005
ACM
93views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Power minimization for dynamic PLAs
—Dynamic programmable logic arrays (PLAs) which are built of the NOR–NOR structure, have been very popular in high performance design because of their high-speed and predictabl...
Tzyy-Kuen Tien, Chih-Shen Tsai, Shih-Chieh Chang, ...
CVPR
2011
IEEE
13 years 4 months ago
RUNE-Tag: a High Accuracy Fiducial Marker with Strong Occlusion Resilience
Over the last decades fiducial markers have provided widely adopted tools to add reliable model-based features into an otherwise general scene. Given their central role in many c...
Filippo Bergamasco, Andrea Albarelli, Andrea Torse...
PAMI
2006
132views more  PAMI 2006»
13 years 8 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
14 years 3 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
AAIM
2005
Springer
119views Algorithms» more  AAIM 2005»
13 years 10 months ago
Locating Performance Monitoring Mobile Agents in Scalable Active Networks
The idea of active networks has been emerged in recent years to increase the processing power inside the network. The intermediate nodes such as routers will be able to host mobile...
Amir Hossein Hadad, Mehdi Dehghan, Hossein Pedram