Sciweavers

1403 search results - page 192 / 281
» Set cover algorithms for very large datasets
Sort
View
CVPR
2003
IEEE
15 years 12 months ago
A 2D Moving Grid Geometric Deformable Model
Geometric deformable models based on the level set method have become very popular in the last several years. To overcome an inherent limitation in accuracy while maintaining comp...
Xiao Han, Chenyang Xu, Jerry L. Prince
TCAD
2002
118views more  TCAD 2002»
14 years 9 months ago
Application-specific clustered VLIW datapaths: early exploration on a parameterized design space
Specialized clustered very large instruction word (VLIW) processors combined with effective compilation techniques enable aggressive exploitation of the high instruction-level para...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 2 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
MOBICOM
2006
ACM
15 years 3 months ago
Fast and reliable estimation schemes in RFID systems
RFID tags are being used in many diverse applications in increasingly large numbers. These capabilities of these tags span from very dumb passive tags to smart active tags, with t...
Murali S. Kodialam, Thyaga Nandagopal
HYBRID
2000
Springer
15 years 1 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...