2127 search results - page 189 / 426 » Computing large matchings fast |
127
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
156
click to vote
CIKM
2005
Springer
15 years 10 months ago
2005
Springer
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
156
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
121
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper describes the recognition of container code characters. The system has to deal with outdoor images which usually have damaged characters and obtain an answer in real ti...
154
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...