Sciweavers

3206 search results - page 175 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
CVPR
2004
IEEE
16 years 5 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
JMLR
2006
125views more  JMLR 2006»
15 years 3 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
124
Voted
GECCO
2010
Springer
206views Optimization» more  GECCO 2010»
15 years 6 months ago
Development of efficient particle swarm optimizers by using concepts from evolutionary algorithms
Particle swarm optimization (PSO) has been in practice for more than 10 years now and has gained wide popularity in various optimization tasks. In the context to single objective ...
Kalyanmoy Deb, Nikhil Padhye
EC
2007
167views ECommerce» more  EC 2007»
15 years 3 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
15 years 10 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy