Sciweavers

7978 search results - page 401 / 1596
» Representation before computation
Sort
View
CCCG
1998
15 years 8 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
VIP
2003
15 years 8 months ago
Screen Capture - A Vector Quantisation Approach
Over the last couple of decades, more and more presentations are done on computer screen. The need to store or broadcast such presentation efficiently is in high demand across dif...
Jesse S. Jin, Sue R. Wu
IJCAI
1989
15 years 8 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
15 years 7 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho
CJ
2010
98views more  CJ 2010»
15 years 7 months ago
On Ultrametric Algorithmic Information
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
Fionn Murtagh