61 search results - page 9 / 13 » Pointed binary encompassing trees: Simple and optimal |
205
Voted
SCAI
1997
15 years 9 months ago
1997
The class of well-behaved evaluation functions simplifies and makes efficient the handling of numerical attributes; for them it suffices to concentrate on the boundary points in...
225
click to vote
ML
2008
ACM
15 years 7 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
203
Voted
SAGA
2001
Springer
16 years 3 days ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
218
click to vote
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
200
click to vote
MICRO
2005
IEEE
16 years 1 months ago
2005
IEEE
We introduce techniques to support efficient non-atomic execution of very long traces on a new binary translation based, x86-64 compatible VLIW microprocessor. Incrementally comm...