Sciweavers

1949 search results - page 367 / 390
» Random graphs on surfaces
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
12 years 1 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
CVPR
2012
IEEE
12 years 1 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
CVPR
2007
IEEE
15 years 27 days ago
Seamless Mosaicing of Image-Based Texture Maps
Image-based object modeling has emerged as an important computer vision application. Typically, the process starts with the acquisition of the image views of an object. These view...
Victor S. Lempitsky, Denis V. Ivanov
ICASSP
2009
IEEE
14 years 5 months ago
Scalable distributed source coding
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose
ASIACRYPT
2009
Springer
14 years 5 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...