Sciweavers

3422 search results - page 55 / 685
» Random Subset Optimization
Sort
View
PVLDB
2010
120views more  PVLDB 2010»
15 years 20 days ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
ACL
2012
13 years 4 months ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu
ICMLA
2007
15 years 3 months ago
Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 6 months ago
Search--based approaches to the component selection and prioritization problem
This poster paper addresses the problem of choosing sets of software components to combine in component
Mark Harman, Alexandros Skaliotis, Kathleen Steinh...
CIKM
2009
Springer
15 years 8 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...