Sciweavers

93 search results - page 9 / 19
» Fast Monte-Carlo Algorithms for Finding Low-Rank Approximati...
Sort
View
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
ICCV
1999
IEEE
14 years 9 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ATAL
2010
Springer
13 years 8 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
ICIP
2001
IEEE
14 years 9 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
IAT
2006
IEEE
14 years 1 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...