Sciweavers

714 search results - page 103 / 143
» An efficient algorithm for positive realizations
Sort
View
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
16 years 5 days ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
ICPR
2008
IEEE
15 years 6 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 4 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
EURONGI
2008
Springer
15 years 1 months ago
Performance Evaluation of DTSN in Wireless Sensor Networks
The guaranteed delivery of critical data is an essential requirement in most Wireless Sensor Network (WSN) applications. The paucity of energy, communication, processing and storag...
Francisco Rocha, António Grilo, Paulo Rog&e...
ICVGIP
2008
15 years 1 months ago
Visibility Cuts: A System for Rendering Dynamic Virtual Environments
In recent years, the subject of occlusion culling of large 3D environments has received substantial contribution. However the major amount of research into the area has focussed o...
Soumyajit Deb, Ankit Gupta