Sciweavers

3495 search results - page 409 / 699
» On the random satisfiable process
Sort
View
TMI
2002
113views more  TMI 2002»
15 years 6 months ago
Spatiotemporal reconstruction of list mode PET data
We describe a method for computing a continuous time estimate of tracer density using list-mode positron emission tomography data. The rate function in each voxel is modeled as an ...
Thomas E. Nichols, Jinyi Qi, Evren Asma, Richard M...
TON
2002
175views more  TON 2002»
15 years 6 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 5 months ago
Fractional Repetition Codes for Repair in Distributed Storage Systems
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
Salim Y. El Rouayheb, Kannan Ramchandran
FOCM
2010
140views more  FOCM 2010»
15 years 5 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
JITECH
2010
106views more  JITECH 2010»
15 years 5 months ago
Patterns and structures of intra-organizational learning networks within a knowledge-intensive organization
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
Miha Skerlavaj, Vlado Dimovski, Kevin C. Desouza