699 search results - page 86 / 140 » The method of combinatorial telescoping |
102
click to vote
NHM
2010
14 years 7 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
88
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
85
Voted
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
91
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
112
Voted
BIBE
2007
IEEE
15 years 6 months ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...