5153 search results - page 182 / 1031 » Introduction to Randomized Algorithms |
131
click to vote
MVA
1990
15 years 4 months ago
1990
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
243
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
120
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
105
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
104
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...