93 search results - page 7 / 19 » Information-Based Nonlinear Approximation: An Average Case S... |
PODS
2007
ACM
14 years 7 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
CIA
2006
Springer
13 years 11 months ago
2006
Springer
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...