Sciweavers

199 search results - page 31 / 40
» Higher-Order Critical Pairs
Sort
View
IDA
2009
Springer
13 years 5 months ago
Context-Based Distance Learning for Categorical Data Clustering
Abstract. Clustering data described by categorical attributes is a challenging task in data mining applications. Unlike numerical attributes, it is difficult to define a distance b...
Dino Ienco, Ruggero G. Pensa, Rosa Meo
SCIENTOMETRICS
2010
131views more  SCIENTOMETRICS 2010»
13 years 2 months ago
Academic team formation as evolving hypergraphs
This paper quantitatively explores the social and socio-semantic patterns of constitution of academic collaboration teams. To this end, we broadly underline two critical features ...
Carla Taramasco, Jean-Philippe Cointet, Camille Ro...
ICML
2004
IEEE
14 years 8 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
DSD
2009
IEEE
118views Hardware» more  DSD 2009»
14 years 2 months ago
Internet-Router Buffered Crossbars Based on Networks on Chip
—The scalability and performance of the Internet depends critically on the performance of its packet switches. Current packet switches are based on single-hop crossbar fabrics, w...
Kees Goossens, Lotfi Mhamdi, Iria Varela Senin
ISPD
2005
ACM
188views Hardware» more  ISPD 2005»
14 years 1 months ago
A semi-persistent clustering technique for VLSI circuit placement
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
Charles J. Alpert, Andrew B. Kahng, Gi-Joon Nam, S...