Sciweavers

402 search results - page 69 / 81
» Constant-Time Approximation Algorithms via Local Improvement...
Sort
View
JMLR
2012
12 years 12 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
FPGA
2009
ACM
154views FPGA» more  FPGA 2009»
15 years 4 months ago
Synthesis of reconfigurable high-performance multicore systems
Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerati...
Jason Cong, Karthik Gururaj, Guoling Han
SPAA
2004
ACM
15 years 2 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
ECCV
2006
Springer
15 years 11 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
CVPR
2012
IEEE
12 years 12 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould