Sciweavers

844 search results - page 169 / 169
» Homotopy in Digital Spaces
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 6 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
PODS
2009
ACM
124views Database» more  PODS 2009»
14 years 6 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...
COMPGEOM
2006
ACM
13 years 11 months ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
ACISP
1997
Springer
13 years 9 months ago
Enabling Technology for the Trading of MPEG-encoded Video
tracts, pp. 11-17. (http://www.qucis.queens.ca/achallc97/papers/p028.html) Alexa, Melina; Rostek, Lothar Pattern Concordances - TATOE calls XGrammar. Presented at ACH -ALLC97, King...
Jana Dittmann, Arnd Steinmetz