Sciweavers

4131 search results - page 6 / 827
» Compactness in Topology and Computation
Sort
View
84
Voted
APAL
2010
141views more  APAL 2010»
14 years 9 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters
ICML
2007
IEEE
15 years 10 months ago
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
Sridhar Mahadevan
DBPL
1999
Springer
109views Database» more  DBPL 1999»
15 years 1 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
JSYML
2002
96views more  JSYML 2002»
14 years 9 months ago
Definitions of Compactness and The Axiom of Choice
We study the relationships between definitions of compactness in topological spaces and the roll the axiom of choice plays in these relationships.
Omar de la Cruz, Eric J. Hall, Paul E. Howard, Jea...
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...