Sciweavers

5214 search results - page 10 / 1043
» The Online Specialization Problem
Sort
View
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
14 years 1 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
ICCL
1998
IEEE
13 years 11 months ago
Controlled Self-Applicable On-Line Partial Evaluation, Using Strategies
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
M. Beckman, Samuel N. Kamin
ECIS
2003
13 years 8 months ago
Using online services in untrusted environments: a privacy-preserving architecture
While online service providers are sometimes accused of forwarding identifying customer information as name and address to untrusted third parties, comparatively little attention ...
Claus Boyens, Oliver Günther
COLT
2010
Springer
13 years 5 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 2 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu