3663 search results - page 442 / 733 » Problems in the ontology of computer programs |
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
183
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
194
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
215
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
198
click to vote
DSN
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...