406 search results - page 49 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
131
click to vote
NIPS
2001
15 years 1 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
113
click to vote
VLSID
2004
IEEE
16 years 5 days ago
2004
IEEE
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
123
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
110
click to vote
INFORMATICALT
2006
14 years 11 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
131
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...