2127 search results - page 53 / 426 » Computing large matchings fast |
122
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
108
click to vote
CCS
1998
ACM
15 years 7 months ago
1998
ACM
State-of-the-art and emerging scientific applications require fast access to large quantities of data and commensurately fast computational resources. Both resources and data are ...
136
Voted
DAC
2005
ACM
15 years 5 months ago
2005
ACM
Capturing RLCK circuit responses accurately with existing model order reduction (MOR) techniques is very expensive. Direct metrics for fast analysis of RC circuits exist but there...
145
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
2-D face recognition in the presence of large pose variations presents a significant challenge. When comparing a frontal image of a face to a near profile image, one must cope w...
139
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...