1331 search results - page 175 / 267 » Complexity bounds for zero-test algorithms |
146
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
222
click to vote
TOPLAS
2008
15 years 3 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
133
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
121
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
121
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...