Sciweavers

824 search results - page 90 / 165
» Weighted Low-Rank Approximations
Sort
View
ECCC
2000
158views more  ECCC 2000»
14 years 9 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
JSC
1998
68views more  JSC 1998»
14 years 9 months ago
An Algorithm for Computing the Integral Closure
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field. Leonard and Pellikaan [4] devised an algorithm for c...
Theo De Jong
PE
2007
Springer
97views Optimization» more  PE 2007»
14 years 9 months ago
On processor sharing and its applications to cellular data network provisioning
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...
Yujing Wu, Carey L. Williamson, Jingxiang Luo
ICCV
2011
IEEE
13 years 9 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
ICTCS
2005
Springer
15 years 3 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat