Sciweavers

210 search results - page 22 / 42
» Excludability and Bounded Computational Capacity
Sort
View
FOCS
2005
IEEE
14 years 3 months ago
Metric Embeddings with Relaxed Guarantees
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Ked...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 10 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ICC
2007
IEEE
14 years 4 months ago
Training Optimization for Gauss-Markov Rayleigh Fading Channels
— 1 In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T sym...
Sami Akin, Mustafa Cenk Gursoy
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 10 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
AIPS
2004
13 years 11 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck