2370 search results - page 401 / 474 » The Characterization of Data-Accumulating Algorithms |
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
102
click to vote
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...