17760 search results - page 245 / 3552 » A Generalization of the Massey-Ding Algorithm |
142
click to vote
JDA
2010
14 years 11 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
130
click to vote
CHI
2006
ACM
16 years 5 months ago
2006
ACM
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
171
click to vote
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
149
click to vote
WG
2001
Springer
15 years 9 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
152
click to vote
UAI
2004
15 years 6 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...