1322 search results - page 170 / 265 » Parameterized counting problems |
103
click to vote
FPGA
1997
ACM
15 years 8 months ago
1997
ACM
ct High-capacity FPGAs pose device architects with a variety of problems. The most obvious of these problems is interconnect capacity. Others include interconnect performance, cloc...
131
click to vote
CAP
2010
14 years 11 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
132
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
226
Voted
POPL
2005
ACM
16 years 4 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
139
click to vote
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...