2100 search results - page 275 / 420 » Fundamentals of the problem |
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
We present a new approach to personalized handwriting recognition. The problem, also known as writer adaptation, consists of converting a generic (user-independent) recognizer int...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
RECOMB
2003
Springer
14 years 9 months ago
2003
Springer
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...