Sciweavers

4850 search results - page 215 / 970
» Proof and Computation in Geometry
Sort
View
SPAA
2004
ACM
15 years 12 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CGF
2006
125views more  CGF 2006»
15 years 6 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
CGF
2008
130views more  CGF 2008»
15 years 6 months ago
Reduced Depth and Visual Hulls of Complex 3D Scenes
Depth and visual hulls are useful for quick reconstruction and rendering of a 3D object based on a number of reference views. However, for many scenes, especially multi-object, th...
Alexander Bogomjakov, Craig Gotsman
GC
2004
Springer
15 years 12 months ago
The KGP Model of Agency for Global Computing: Computational Model and Prototype Implementation
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
Andrea Bracciali, Neophytos Demetriou, Ulrich Endr...
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas