2542 search results - page 306 / 509 » Computing Cartograms with Optimal Complexity |
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
114
Voted
DCC
2005
IEEE
15 years 12 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
82
Voted
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
Investors would like to calculate profits in advance, “ex ante”, like the path of a flying ball. But income can only be given “ex post”, after the money is earned. The pro...
115
Voted
MDM
2009
Springer
15 years 7 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...