3874 search results - page 227 / 775 » Approximation Algorithms for k-hurdle Problems |
145
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
136
click to vote
FORMATS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
136
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
119
Voted
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
147
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...