1024 search results - page 68 / 205 » Value complete, column complete, predicate complete |
100
click to vote
JMLR
2010
14 years 8 months ago
2010
A composite loss assigns a penalty to a realvalued prediction by associating the prediction with a probability via a link function then applying a class probability estimation (CP...
243
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
142
click to vote
INTERNET
2002
15 years 1 months ago
2002
of abstractions a middleware system makes available to applications, they figure prominently in determining the breadth and variety of application integration that the middleware s...
154
Voted
COR
2008
15 years 1 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
118
Voted
JMLR
2010
14 years 8 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...