Sciweavers

12562 search results - page 2033 / 2513
» Distributed Xbean Applications
Sort
View
132
Voted
EJC
2006
15 years 5 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
JACM
2006
146views more  JACM 2006»
15 years 5 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
JPDC
2006
134views more  JPDC 2006»
15 years 5 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
182
Voted
RSA
2006
144views more  RSA 2006»
15 years 4 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
130
Voted
BIOINFORMATICS
2005
89views more  BIOINFORMATICS 2005»
15 years 4 months ago
Doelan: a solution for quality control monitoring of microarray production
: Doelan is an automated tool to check the quality of produced DNA microarrays. This software is based on the execution of test suites on quality control data to validate batches o...
Laurent Jourdren, Stéphane Le Crom
« Prev « First page 2033 / 2513 Last » Next »