Sciweavers

969 search results - page 181 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 6 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
PAMI
2012
11 years 11 months ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre
DIS
2005
Springer
14 years 2 months ago
The Arrowsmith Project: 2005 Status Report
In the 1980s, Don Swanson proposed the concept of “undiscovered public knowledge,” and published several examples in which two disparate literatures (i.e., sets of articles hav...
Neil R. Smalheiser
IMC
2004
ACM
14 years 2 months ago
Robust synchronization of software clocks across the internet
Accurate, reliable timestamping which is also convenient and inexpensive is needed in many important areas including real-time network applications and network measurement. Recent...
Darryl Veitch, Satish Babu Korada, Attila Pá...
NSPW
2004
ACM
14 years 2 months ago
Support for multi-level security policies in DRM architectures
Digital rights management systems allow copyrighted content to be commercialized in digital format without the risk of revenue loss due to piracy. Making such systems secure is no...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...