Sciweavers

7092 search results - page 1224 / 1419
» Parallelizing constraint programs
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 2 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
97
Voted
CADE
2008
Springer
16 years 2 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
115
Voted
CADE
2006
Springer
16 years 2 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
120
Voted
DCC
2008
IEEE
16 years 1 months ago
Server Placement in Multiple-Description-Based Media Streaming
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
Satyajeet Ahuja, Marwan Krunz
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
Global Illumination Compensation for Spatially Augmented Reality
When projectors are used to display images on complex, non-planar surface geometry, indirect illumination between the surfaces will disrupt the final appearance of this imagery, ...
Yu Sheng, Theodore C. Yapo, Barbara Cutler
« Prev « First page 1224 / 1419 Last » Next »