Sciweavers

587 search results - page 20 / 118
» Compactness of Loeb Spaces
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz
ICNP
2007
IEEE
14 years 1 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
ICASSP
2011
IEEE
12 years 11 months ago
Wavelet footprints for detection and sorting of extracellular neural action potentials
Spike detection and sorting is a fundamental step in the analysis of extracellular neural recording. Here, we propose a combined spike detection-feature extraction algorithm that ...
Ki Yong Kwon, Karim G. Oweiss
ICASSP
2011
IEEE
12 years 11 months ago
A novel vector quantization-based video summarization method using independent component analysis mixture model
In this paper, we present a new independent component analysis mixture vector quantization (ICAMVQ) method to summarize the video content. In particular, independent component ana...
Junfeng Jiang, Xiao-Ping Zhang
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 8 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...