Sciweavers

5244 search results - page 1028 / 1049
» When are two algorithms the same
Sort
View
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 1 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 1 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 1 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
ESOP
2007
Springer
14 years 1 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
CVPR
2006
IEEE
14 years 1 months ago
Automatic Landmark Tracking and its Application to the Optimization of Brain Conformal Mapping
Anatomical features on cortical surfaces are usually represented by landmark curves, called sulci/gyri curves. These landmark curves are important information for neuroscientists ...
Lok Ming Lui, Yalin Wang, Tony F. Chan, Paul M. Th...
« Prev « First page 1028 / 1049 Last » Next »