Sciweavers

2376 search results - page 403 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
113
Voted
ASPDAC
2008
ACM
124views Hardware» more  ASPDAC 2008»
15 years 5 months ago
MaizeRouter: Engineering an effective global router
In this paper, we present the complete design and architectural details of MAIZEROUTER. MAIZEROUTER reflects a significant leap in progress over existing publicly available routing...
Michael D. Moffitt
138
Voted
DICTA
2003
15 years 5 months ago
Unsupervised Segmentation of Moving MPEG Blocks Based on Classification of Temporal Information
Most codecs such as MPEG-1,2 are based on processing pixels in predetermined tiles of square blocks. The processing of each block is independent of the object-based contents that m...
Ofer Miller, Amir Averbuch, Yosi Keller
75
Voted
WSC
2004
15 years 5 months ago
Approximating Component Selection
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
Michael Roy Fox, David C. Brogan, Paul F. Reynolds...
139
Voted
UAI
2000
15 years 5 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
121
Voted
CASCON
1992
134views Education» more  CASCON 1992»
15 years 4 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons