3946 search results - page 372 / 790 » The computational complexity of choice sets |
198
click to vote
CIKM
1999
Springer
15 years 12 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
189
click to vote
VLDB
1995
ACM
15 years 11 months ago
1995
ACM
Several recent trends have changed the usage and users of schemas beyond those of a database administrator’s tool for describing database contents. Distribution of computing pow...
213
click to vote
WSC
2007
15 years 10 months ago
2007
Time is an important data dimension with distinct characteristics that is common across many application domains. This demands specialized methods in order to support proper analy...
225
click to vote
COMPGEOM
2008
ACM
15 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
290
click to vote
NIPS
2008
15 years 9 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...