272 search results - page 21 / 55 » Minimal Function Graphs are not Instrumented |
138
click to vote
KR
1994
Springer
15 years 9 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
135
Voted
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
125
Voted
SIGMETRICS
2006
ACM
15 years 11 months ago
2006
ACM
Performance monitoring in most distributed systems provides minimal guidance for tuning, problem diagnosis, and decision making. Stardust is a monitoring infrastructure that repla...
149
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
144
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...