3875 search results - page 494 / 775 » Approximation algorithms for the 0-extension problem |
204
Voted
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
199
click to vote
INFOCOM
2006
IEEE
16 years 21 days ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
144
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
179
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
182
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...