13603 search results - page 247 / 2721 » On the Complexity of Computing Treelength |
173
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
170
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
140
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
164
click to vote
ORL
2006
15 years 5 months ago
2006
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
176
click to vote
SMA
2008
ACM
15 years 5 months ago
2008
ACM
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...