Sciweavers

1830 search results - page 232 / 366
» Workshop on Graph Computation Models
Sort
View
CCS
2009
ACM
16 years 6 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
PPOPP
2005
ACM
15 years 11 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
CVPR
2008
IEEE
16 years 8 months ago
FusionFlow: Discrete-continuous optimization for optical flow estimation
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
Victor S. Lempitsky, Stefan Roth, Carsten Rother
PPSN
1992
Springer
15 years 10 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
ICDIM
2007
IEEE
16 years 17 days ago
Exploiting multi-evidence from multiple user's interests to personalizing information retrieval
The goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a no...
Lynda Tamine-Lechani, Mohand Boughanem, Nesrine Ze...