332 search results - page 45 / 67 » The Monochromatic Column problem |
ICML
2003
IEEE
14 years 10 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
CPM
1998
Springer
14 years 2 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
JMLR
2006
13 years 9 months ago
2006
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
ICDE
2008
IEEE
14 years 11 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...