Sciweavers

2503 search results - page 26 / 501
» New Algorithms for Statistical Analysis of Interval Data
Sort
View
NIPS
2008
15 years 1 months ago
Kernel Measures of Independence for non-iid Data
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smo...
ISAAC
2007
Springer
77views Algorithms» more  ISAAC 2007»
15 years 5 months ago
On the Relative Dominance of Paging Algorithms
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
Reza Dorrigiv, Alejandro López-Ortiz, J. Ia...
ICCAD
2004
IEEE
118views Hardware» more  ICCAD 2004»
15 years 8 months ago
Optimizing mode transition sequences in idle intervals for component-level and system-level energy minimization
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
Jinfeng Liu, Pai H. Chou
ICDCS
2010
IEEE
15 years 3 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang
PAMI
2008
215views more  PAMI 2008»
14 years 11 months ago
Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-co...
Brent C. Munsell, Pahal Dalal, Song Wang