Sciweavers

1921 search results - page 70 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
CVPR
2009
IEEE
16 years 9 months ago
Half-integrality based algorithms for Cosegmentation of Images
We study the cosegmentation problem where the objective is to segment the same object (i.e., region) from a pair of images. The segmentation for each image can be cast using a p...
Chuck R. Dyer, Lopamudra Mukherjee, Vikas Singh
PDP
2008
IEEE
15 years 8 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 5 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
MANSCI
2006
121views more  MANSCI 2006»
15 years 2 months ago
Methodologies and Algorithms for Group-Rankings Decision
The problem of group ranking, a.k.a. rank aggregation, has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to ranking web pag...
Dorit S. Hochbaum, Asaf Levin
ICML
2004
IEEE
16 years 3 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch