Sciweavers

10608 search results - page 1646 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CIKM
2009
Springer
16 years 25 days ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
16 years 25 days 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»
16 years 25 days 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
OOPSLA
2009
Springer
16 years 24 days ago
Towards automation of iteration planning
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
Jonas Helming, Maximilian Koegel, Zardosht Hodaie
158
Voted
COMPGEOM
2009
ACM
16 years 24 days ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
« Prev « First page 1646 / 2122 Last » Next »