2513 search results - page 355 / 503 » Improving Generalization by Data Categorization |
154
click to vote
RECOMB
2002
Springer
16 years 5 months ago
2002
Springer
We present a probabilistic framework that models the process by which transcriptional binding explains the mRNA expression of different genes. Our joint probabilistic model unifie...
234
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
134
click to vote
SIGMOD
2001
ACM
16 years 5 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
168
click to vote
WSDM
2010
ACM
16 years 2 months ago
2010
ACM
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
138
Voted
CCGRID
2008
IEEE
15 years 11 months ago
2008
IEEE
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...