4066 search results - page 180 / 814 » Almost Complete Sets |
191
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
186
click to vote
APPROX
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
182
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
198
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
150
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
When more than a single classifier has been trained for the same recognition problem the question arises how this set of classifiers may be combined into a final decision rule. Se...