2800 search results - page 259 / 560 » Scaling RDF with time |
166
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
126
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Due to scaling laws, in microfluidic, flows are laminar. Consequently, mixing between two liquids is mainly obtained by natural diffusion which may take a long time or equivalentl...
170
click to vote
DKE
2002
15 years 6 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
219
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
182
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...