Sciweavers

53 search results - page 10 / 11
» On the Existence of Linear Weak Learners and Applications to...
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
INFOCOM
2009
IEEE
14 years 2 months ago
Effective Delay Control in Online Network Coding
—Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that t...
João Barros, Rui A. Costa, Daniele Munarett...
SSDBM
2003
IEEE
111views Database» more  SSDBM 2003»
14 years 19 days ago
Performance Evaluation of Spatio-temporal Selectivity Estimation Techniques
— Many novel spatio-temporal applications deal with moving objects. In such environments, a database typically maintains the initial position and the moving function for each obj...
Marios Hadjieleftheriou, George Kollios, Vassilis ...
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Communication and Round Efficient Information Checking Protocol
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
Arpita Patra, C. Pandu Rangan
TCS
2008
13 years 7 months ago
Computational self-assembly
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
Pierre-Louis Curien, Vincent Danos, Jean Krivine, ...