185 search results - page 23 / 37 » Solving problems on recursively constructed graphs |
106
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
DNA
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
109
click to vote
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
115
Voted
DM
2006
14 years 11 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
112
click to vote
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...