2542 search results - page 268 / 509 » Computing Cartograms with Optimal Complexity |
107
Voted
SC
2000
ACM
15 years 4 months ago
2000
ACM
This paper proposes a hardware mechanism for reducing coherency overhead occurring in scientific computations within DSM systems. A first phase aims at detecting, in the address s...
101
Voted
AUTOMATICA
2005
15 years 13 days ago
2005
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
121
Voted
SAT
2009
Springer
15 years 7 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
124
Voted
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
116
click to vote
SIGMOD
2003
ACM
16 years 20 days ago
2003
ACM
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...