Sciweavers

1167 search results - page 203 / 234
» Limits of Spectral Clustering
Sort
View
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
13 years 10 months ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
DAGSTUHL
2007
13 years 10 months ago
Discovering Knowledge from Local Patterns with Global Constraints
It is well known that local patterns are at the core of a lot of knowledge which may be discovered from data. Nevertheless, use of local patterns is limited by their huge number an...
Bruno Crémilleux, Arnaud Soulet
NSDI
2010
13 years 10 months ago
Hedera: Dynamic Flow Scheduling for Data Center Networks
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
GRAPHICSINTERFACE
2007
13 years 10 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
ICMLA
2007
13 years 10 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio