Sciweavers

924 search results - page 3 / 185
» On the number of ordered factorizations of natural numbers
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 7 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
GBRPR
2007
Springer
14 years 6 days ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan
DAM
1999
105views more  DAM 1999»
13 years 5 months ago
The b-chromatic Number of a Graph
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
Robert W. Irving, David Manlove
BMCBI
2010
146views more  BMCBI 2010»
13 years 6 months ago
On the Choice and Number of Microarrays for Transcriptional Regulatory Network Inference
Background: Transcriptional regulatory network inference (TRNI) from large compendia of DNA microarrays has become a fundamental approach for discovering transcription factor (TF)...
Elissa J. Cosgrove, Timothy S. Gardner, Eric D. Ko...
EUROCRYPT
1999
Springer
13 years 10 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels