70 search results - page 7 / 14 » Compactness in locales and in formal topology |
71
Voted
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
97
Voted
OTM
2005
Springer
15 years 3 months ago
2005
Springer
Distributed mobile applications operate on devices with diverse capabilities, in heterogeneous environments, where parameters such as processor, memory and network utilisation, are...
ACL
1996
14 years 11 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
SENSYS
2003
ACM
15 years 2 months ago
2003
ACM
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
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'...