Sciweavers

4114 search results - page 414 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 8 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CIKM
2010
Springer
15 years 4 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
ICIP
2008
IEEE
16 years 8 months ago
Multiple description video decoding using map
The problem of efficient video transmission over noisy channels involves good compression rates and robustness in presence of channel failures. The proposed framework of joint sou...
Marc Antonini, Marie Andrée Agostini
WCNC
2008
IEEE
16 years 1 months ago
Estimation of Link Quality and Residual Time in Vehicular Ad Hoc Networks
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
Nikoletta Sofra, Kin K. Leung