2127 search results - page 180 / 426 » Computing large matchings fast |
222
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
—This paper presents an Improved Snake Model (ISM) effective for performing fast image segmentation. The work takes advantage of two well-known snake models of Balloon [1] and GG...
150
click to vote
DAC
2005
ACM
15 years 6 months ago
2005
ACM
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
130
click to vote
AAAI
1998
15 years 5 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
157
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper presents a fast, accurate, and novel method for the problem of estimating the number of humans and their positions from background differenced images obtained from a si...
128
click to vote
ACSC
2004
IEEE
15 years 8 months ago
2004
IEEE
Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithm...