Sciweavers

3946 search results - page 50 / 790
» The computational complexity of choice sets
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
14 years 11 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
ESSMAC
2003
Springer
15 years 5 months ago
Filtered Gaussian Processes for Learning with Large Data-Sets
Kernel-based non-parametric models have been applied widely over recent years. However, the associated computational complexity imposes limitations on the applicability of those me...
Jian Qing Shi, Roderick Murray-Smith, D. M. Titter...
COMPGEOM
1997
ACM
15 years 4 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
ICLP
2009
Springer
16 years 13 days ago
Finding Similar or Diverse Solutions in Answer Set Programming
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
Thomas Eiter, Esra Erdem, Halit Erdogan, Michael F...
CVPR
1996
IEEE
16 years 1 months ago
Minimal operator set for passive depth from defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
Masahiro Watanabe, Shree K. Nayar