Sciweavers

1182 search results - page 143 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
111
Voted
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 6 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
117
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Worst-case based robust adaptive beamforming for general-rank signal models using positive semi-definite covariance constraint
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
Haihua Chen, Alex B. Gershman
154
Voted
CVPR
2012
IEEE
13 years 5 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
HIPEAC
2009
Springer
15 years 9 months ago
Collective Optimization
Abstract. Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gat...
Grigori Fursin, Olivier Temam
156
Voted
TWC
2008
135views more  TWC 2008»
15 years 2 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...