2988 search results - page 223 / 598 » Experiments with a New Boosting Algorithm |
129
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
136
click to vote
JCST
2008
15 years 4 months ago
2008
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
145
click to vote
TIP
1998
15 years 4 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
194
click to vote
PVLDB
2008
15 years 3 months ago
2008
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
144
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
A structured approach to parallel programming allows to construct applications by composing skeletons, i.e., recurring patterns of task- and data-parallelism. First academic and co...