4541 search results - page 379 / 909 » Cache-Oblivious Algorithms and Data Structures |
143
click to vote
TMI
2010
15 years 3 months ago
2010
—This paper provides a framework for generating high resolution time sequences of 3D images that show the dynamics of cerebral blood flow. These sequences have the potential to ...
158
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
141
click to vote
JACM
2000
15 years 4 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
131
click to vote
ICGI
2004
Springer
15 years 10 months ago
2004
Springer
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
250
Voted
ISNN
2011
Springer
14 years 7 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...