2542 search results - page 324 / 509 » Computing Cartograms with Optimal Complexity |
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
SIGGRAPH
1996
ACM
14 years 2 months ago
1996
ACM
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
CLUSTER
2001
IEEE
14 years 2 months ago
2001
IEEE
This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. Existing parallel file systems offer little control over matc...
AAAI
2010
14 years 7 days ago
2010
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...