1920 search results - page 122 / 384 » The Complexity of the A B C Problem |
270
click to vote
GIS
2009
ACM
16 years 7 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
189
click to vote
TALG
2010
15 years 1 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
193
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
168
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Extracting human postural information from video sequences has proved a difficult research question. The most successful approaches to date have been based on particle filtering, ...
154
click to vote
COLCOM
2008
IEEE
16 years 29 days ago
2008
IEEE
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...