Sciweavers

4377 search results - page 5 / 876
» Mass problems and randomness
Sort
View
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
14 years 1 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
MSS
2000
IEEE
124views Hardware» more  MSS 2000»
13 years 11 months ago
Towards Mass Storage Systems with Object Granularity
Many applications, that need mass storage, manipulate data sets with KB – MB size objects. In contrast, mass storage devices work most efficiently for the storage and transfer ...
Koen Holtman, Peter van der Stok, Ian Willers
ECCB
2008
IEEE
13 years 8 months ago
Towards de novo identification of metabolites by analyzing tandem mass spectra
Abstract. Mass spectrometry is among the most widely used technologies in proteomics and metabolomics. For metabolites, de novo interpretation of spectra is even more important tha...
Sebastian Böcker, Florian Rasche
ICTAI
2003
IEEE
14 years 9 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 7 months ago
On the reduction of a random basis
For p n, let b (n) 1 , . . . , b (n) p be independent random vectors in Rn with the same distribution invariant by rotation and without mass at the origin. Almost surely these vec...
Ali Akhavi, Jean-François Marckert, Alain R...