4112 search results - page 301 / 823 » Efficient Algorithms for the Spoonerism Problem |
206
click to vote
TSP
2008
15 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
194
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
301
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
199
click to vote
JCB
2006
15 years 6 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
183
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...