1093 search results - page 84 / 219 » Clustering from Constraint Graphs |
DAC
2007
ACM
16 years 26 days ago
2007
ACM
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
118
click to vote
ACIVS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
106
click to vote
STAIRS
2008
15 years 1 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
107
click to vote
EMMCVPR
2003
Springer
15 years 5 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
104
click to vote
SDM
2004
SIAM
15 years 1 months ago
2004
SIAM
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...