Sciweavers

2111 search results - page 331 / 423
» Understanding the Yarowsky Algorithm
Sort
View
ATAL
2009
Springer
15 years 7 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
91
Voted
CIKM
2009
Springer
15 years 7 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
101
Voted
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
15 years 7 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 7 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
ISMM
2009
Springer
15 years 7 months ago
Discrete Driver Assistance
Applying computer technology, such as computer vision in driver assistance, implies that processes and data are modeled as being discretized rather than being continuous. The area ...
Reinhard Klette, Ruyi Jiang, Sandino Morales, Tobi...