840 search results - page 149 / 168 » Inapproximability of Combinatorial Optimization Problems |
JPDC
2006
13 years 9 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
BMCBI
2004
13 years 9 months ago
2004
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
We introduce a new data mining problem: mining truth tables in binary datasets. Given a matrix of objects and the properties they satisfy, a truth table identifies a subset of pr...