Sciweavers

17049 search results - page 3307 / 3410
» cans 2007
Sort
View
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 4 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
COCOON
2007
Springer
15 years 4 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...
CONTEXT
2007
Springer
15 years 4 months ago
Discovering Hidden Contextual Factors for Implicit Feedback
Abstract. This paper presents a statistical framework based on Principal Component Analysis (PCA) for discovering the contextual factors which most strongly influence user behavio...
Massimo Melucci, Ryen W. White
81
Voted
COORDINATION
2007
Springer
15 years 4 months ago
Requirements for Routing in the Application Layer
In the application layer of networks, many application servers are middleboxes in the paths of messages from source to destination. Applications require, as a basic coordination me...
Pamela Zave
COREGRID
2007
Springer
15 years 4 months ago
Total Exchange Performance Prediction on Grid Environments
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have b...
Luiz Angelo Steffenel, Emmanuel Jeannot
« Prev « First page 3307 / 3410 Last » Next »