Sciweavers

11565 search results - page 364 / 2313
» Computing Minimal Mappings
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Graph-shifts: Natural image labeling by dynamic hierarchical computing
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
Jason J. Corso, Alan L. Yuille, Zhuowen Tu
ICCV
2007
IEEE
16 years 8 months ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
CLUSTER
2005
IEEE
16 years 14 days ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
EUROCRYPT
2007
Springer
15 years 10 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
EOR
2007
102views more  EOR 2007»
15 years 6 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux