Sciweavers

6365 search results - page 247 / 1273
» Fast Local Computation Algorithms
Sort
View
SPAA
2005
ACM
16 years 2 days ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
PPSN
1998
Springer
15 years 10 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
ICML
2005
IEEE
16 years 7 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
VLSID
2002
IEEE
107views VLSI» more  VLSID 2002»
16 years 6 months ago
Automatic Model Refinement for Fast Architecture Exploration
We present a methodology and algorithms for automatic refinement from a given design specification to an architecture model based on decisions in architecture exploration. An arch...
Junyu Peng, Samar Abdi, Daniel Gajski
IIHMSP
2006
IEEE
180views Multimedia» more  IIHMSP 2006»
16 years 16 days ago
Fast H.264/AVC Inter-Mode Decision with RDC Optimization
A complexity-constrained inter-mode decision algorithm for H.264/AVC video coding is developed using a rate-distortioncomplexity (RDC) optimization framework in this work. The pro...
Yu Hu, Qing Li, Siwei Ma, C. C. Jay Kuo