1071 search results - page 196 / 215 » Programming with enumerable sets of structures |
105
click to vote
CGO
2011
IEEE
14 years 2 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
106
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
PPOPP
2012
ACM
13 years 6 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
132
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
The computer aided diagnosis (CAD) problems of detecting
potentially diseased structures from medical images are
typically distinguished by the following challenging characterist...
WWW
2007
ACM
15 years 11 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...