Sciweavers

1658 search results - page 194 / 332
» Implementing Bit-addressing with Specialization
Sort
View
113
Voted
EDBT
2008
ACM
173views Database» more  EDBT 2008»
16 years 20 days ago
SeMap: a generic mapping construction system
Most previous schema mapping works focus on creating mappings in specific data models for data transformation, failing to capture a richer set of possible relationships between sc...
Ting Wang, Rachel Pottinger
111
Voted
ICFP
2002
ACM
16 years 15 days ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
89
Voted
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
16 years 9 days ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
91
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass
83
Voted
ALT
2007
Springer
15 years 9 months ago
Tuning Bandit Algorithms in Stochastic Environments
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
Jean-Yves Audibert, Rémi Munos, Csaba Szepe...