Sciweavers

1538 search results - page 3 / 308
» Relative Randomness and Cardinality
Sort
View
STACS
2004
Springer
13 years 10 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
ICIP
2002
IEEE
14 years 6 months ago
On steganalysis of random LSB embedding in continuous-tone images
Abstract? In this paper we present an LSB steganalysis technique that can detect the existence of hidden messages that are randomly embedded in the least significant bits of natura...
Sorina Dumitrescu, Xiaolin Wu, Nasir D. Memon
MCS
2010
Springer
13 years 6 months ago
Choosing Parameters for Random Subspace Ensembles for fMRI Classification
Abstract. Functional magnetic resonance imaging (fMRI) is a noninvasive and powerful method for analysis of the operational mechanisms of the brain. fMRI classification poses a sev...
Ludmila I. Kuncheva, Catrin O. Plumpton
VLDB
2004
ACM
93views Database» more  VLDB 2004»
13 years 10 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich
STACS
2007
Springer
13 years 11 months ago
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
: If you can round {0, 1 2} vectors nicely, then all rational vectors.
Benjamin Doerr