Sciweavers

1093 search results - page 112 / 219
» Clustering from Constraint Graphs
Sort
View
104
Voted
IJCGA
2010
78views more  IJCGA 2010»
15 years 25 days ago
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
Bill Jackson, Tibor Jordán
123
Voted
KDD
2010
ACM
304views Data Mining» more  KDD 2010»
15 years 2 months ago
Automatic malware categorization using cluster ensemble
Malware categorization is an important problem in malware analysis and has attracted a lot of attention of computer security researchers and anti-malware industry recently. Todayâ...
Yanfang Ye, Tao Li, Yong Chen, Qingshan Jiang
133
Voted
SPATIALCOGNITION
2000
Springer
15 years 7 months ago
Modelling Navigational Knowledge by Route Graphs
Navigation has always been an interdisciplinary topic of research, because mobile agents of different types are inevitably faced with similar navigational problems. Therefore, huma...
Steffen Werner, Bernd Krieg-Brückner, Theo He...
123
Voted
ICASSP
2010
IEEE
15 years 3 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
154
Voted
ICDCS
2002
IEEE
15 years 8 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efï¬ciently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li