Sciweavers

2969 search results - page 409 / 594
» A space efficient algorithm for group structure computation
Sort
View
NIPS
2008
15 years 7 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
129
Voted
CG
2002
Springer
15 years 6 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
154
Voted
ACL
2010
15 years 4 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
BMCBI
2011
15 years 1 months ago
Clinical Synopsis Search in OMIM
Background: The OMIM database is a tool used daily by geneticists. Syndrome pages include a Clinical Synopsis section containing a list of known phenotypes comprising a clinical s...
Raphael Cohen, Avitan Gefen, Michael Elhadad, Ohad...
157
Voted
ICPR
2000
IEEE
16 years 7 months ago
Comparison of Tracking Techniques Applied to Digital PIV
Digital Particle Image Velocimetry (DPIV) aims at flow visualisation and measurement of flow dynamics in numerous applications, including hydrodynamics, combustion processes and a...
Dmitry Chetverikov, Judit Verestóy, Marcell...