681 search results - page 94 / 137 » General Polynomial Time Decomposition Algorithms |
147
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
109
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
128
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
118
click to vote
COLT
1994
Springer
15 years 6 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
136
Voted
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...