Sciweavers

2600 search results - page 264 / 520
» Clustering with or without the Approximation
Sort
View
PC
2011
318views Management» more  PC 2011»
15 years 1 months ago
High-performance message-passing over generic Ethernet hardware with Open-MX
In the last decade, cluster computing has become the most popular high-performance computing architecture. Although numerous technological innovations have been proposed to improv...
Brice Goglin
ICASSP
2011
IEEE
14 years 10 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
ACL
2012
13 years 8 months ago
Aspect Extraction through Semi-Supervised Modeling
Aspect extraction is a central problem in sentiment analysis. Current methods either extract aspects without categorizing them, or extract and categorize them using unsupervised t...
Arjun Mukherjee, Bing Liu 0001
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
16 years 3 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
179
Voted
WORM
2004
15 years 7 months ago
Preliminary results using scale-down to explore worm dynamics
A major challenge when attempting to analyze and model large-scale Internet phenomena such as the dynamics of global worm propagation is finding ate abstractions that allow us to ...
Nicholas Weaver, Ihab Hamadeh, George Kesidis, Ver...