Sciweavers

105 search results - page 2 / 21
» Almost Optimal Solutions to k-Clustering Problems
Sort
View
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 10 days ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 6 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 6 days ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
CVPR
2007
IEEE
14 years 7 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
PDPTA
2000
13 years 6 months ago
Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems
In this paper, a parallel evolutionary multi-criteria optimization algorithm: DGA and DRMOGA are applied to block layout problems. The results are compared to the results of SGA an...
Shinya Watanabe, Tomoyuki Hiroyasu, Mitsunori Miki