1301 search results - page 71 / 261 » Bounded Version Vectors |
IDA
1997
Springer
15 years 7 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
123
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
146
click to vote
TIT
2002
15 years 3 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
244
click to vote
GIS
2006
ACM
16 years 4 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
124
click to vote
WINE
2009
Springer
15 years 10 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...