Sciweavers

4298 search results - page 415 / 860
» Measurable chromatic numbers
Sort
View
JUCS
2006
87views more  JUCS 2006»
15 years 7 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
ESWA
2007
131views more  ESWA 2007»
15 years 7 months ago
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
Sanja Petrovic, Yong Yang, Moshe Dror
PR
2008
116views more  PR 2008»
15 years 6 months ago
Robust path-based spectral clustering
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. ...
Hong Chang, Dit-Yan Yeung
SIAMCOMP
2008
80views more  SIAMCOMP 2008»
15 years 6 months ago
The Symmetric Group Defies Strong Fourier Sampling
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
Cristopher Moore, Alexander Russell, Leonard J. Sc...
SIGIR
2008
ACM
15 years 6 months ago
Generalising multiple capture-recapture to non-uniform sample sizes
Algorithms in distributed information retrieval often rely on accurate knowledge of the size of a collection. The "multiple capture-recapture" method of Shokouhi et al. ...
Paul Thomas