Sciweavers

5030 search results - page 961 / 1006
» cases 2007
Sort
View
CLEF
2007
Springer
14 years 5 months ago
Domain-Specific IR for German, English and Russian Languages
In participating in this CLEF evaluation campaign, our first objective is to propose and evaluate various indexing and search strategies for the Russian language, in order to obta...
Claire Fautsch, Ljiljana Dolamic, Samir Abdou, Jac...
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 5 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 5 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 5 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
COCOON
2007
Springer
14 years 5 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...