Sciweavers

11211 search results - page 390 / 2243
» Rank-Sensitive Data Structures
Sort
View
CSDA
2006
84views more  CSDA 2006»
15 years 6 months ago
Performing hypothesis tests on the shape of functional data
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
Gareth M. James, Ashish Sood
ICPADS
2006
IEEE
16 years 22 days ago
Flexible, Low-overhead Event Logging to Support Resource Scheduling
Flexible resource management and scheduling policies require detailed system-state information. Traditional, monolithic operating systems with a centralized kernel derive the requ...
Jan Stoess, Volkmar Uhlig
ASPLOS
2011
ACM
14 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
ICIP
2003
IEEE
16 years 8 months ago
Geometric segmentation of 3D structures
Segmentation in volumetric images deals with separating `objects' from their `background' in a given 3D data. Usually, one starts with `edge detectors' that give bi...
Ron Kimmel
MICCAI
2008
Springer
16 years 7 months ago
Discovering Structure in the Space of Activation Profiles in fMRI
We present a method for discovering patterns of activation observed through fMRI in experiments with multiple stimuli/tasks. We introduce an explicit parameterization for the profi...
Danial Lashkari, Ed Vul, Nancy Kanwisher, Polin...