2542 search results - page 173 / 509 » Computing Cartograms with Optimal Complexity |
129
click to vote
NIPS
2007
15 years 4 months ago
2007
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
135
click to vote
CN
2002
15 years 2 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
124
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
141
click to vote
ICCV
2001
IEEE
16 years 4 months ago
2001
IEEE
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...
116
click to vote
ICIP
2000
IEEE
16 years 4 months ago
2000
IEEE
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...