Sciweavers

1068 search results - page 85 / 214
» On Space Bounded Server Algorithms
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 5 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
JMLR
2002
75views more  JMLR 2002»
13 years 7 months ago
Stability and Generalization
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
Olivier Bousquet, André Elisseeff
EUC
2004
Springer
14 years 1 months ago
Power-Aware Scheduling of Mixed Task Sets in Priority-Driven Systems
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
Dongkun Shin, Jihong Kim
ECAI
2008
Springer
13 years 9 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...