3250 search results - page 34 / 650 » Parameterized Learning Complexity |
SIGIR
2011
ACM
13 years 21 days ago
2011
ACM
The majority of the current information retrieval models weight the query concepts (e.g., terms or phrases) in an unsupervised manner, based solely on the collection statistics. I...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
MICCAI
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. We develop a general approach that uses holomorphic 1forms to parameterize anatomical surfaces with complex (possibly branching) topology. Rather than evolve the surface ...
TAMC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
ICCAD
2006
IEEE
14 years 6 months ago
2006
IEEE
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...