3652 search results - page 371 / 731 » A study of query length |
119
click to vote
IH
2005
Springer
15 years 9 months ago
2005
Springer
There are many detectors for simple Least Significant Bit (LSB) steganography in digital images, the most sensitive of which make use of structural or combinatorial properties of ...
141
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
128
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
121
click to vote
WABI
2004
Springer
15 years 9 months ago
2004
Springer
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
129
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
—We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple-access (TDMA) model with a finite buffer and s...