Sciweavers

1814 search results - page 122 / 363
» Watermarking relational data: framework, algorithms and anal...
Sort
View
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
15 years 5 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
BMCBI
2010
144views more  BMCBI 2010»
14 years 11 months ago
Super-sparse principal component analyses for high-throughput genomic data
Background: Principal component analysis (PCA) has gained popularity as a method for the analysis of highdimensional genomic data. However, it is often difficult to interpret the ...
Donghwan Lee, Woojoo Lee, Youngjo Lee, Yudi Pawita...
BMCBI
2007
123views more  BMCBI 2007»
14 years 11 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
ITNG
2010
IEEE
15 years 4 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 3 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo