620 search results - page 44 / 124 » A Simple and Fast Min-cut Algorithm |
115
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
TIT
2008
14 years 11 months ago
2008
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
101
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
103
click to vote
DEBU
2010
14 years 9 months ago
2010
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
AAAI
2000
15 years 1 months ago
2000
Simple Temporal Networks (STNs) have proved useful in applications that involve metric time. However, many applications involve events whose timing is uncertain in the sense that ...