Sciweavers

324 search results - page 24 / 65
» Two-way Replacement Selection
Sort
View
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
ICAI
2004
13 years 8 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
TCAD
1998
126views more  TCAD 1998»
13 years 7 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
ISCA
2011
IEEE
273views Hardware» more  ISCA 2011»
12 years 11 months ago
Bypass and insertion algorithms for exclusive last-level caches
Inclusive last-level caches (LLCs) waste precious silicon estate due to cross-level replication of cache blocks. As the industry moves toward cache hierarchies with larger inner l...
Jayesh Gaur, Mainak Chaudhuri, Sreenivas Subramone...
CVPR
2009
IEEE
15 years 2 months ago
Large Displacement Optical Flow
The literature currently provides two ways to establish point correspondences between images with moving objects. On one side, there are energy minimization methods that yield v...
Thomas Brox (University of California, Berkeley), ...