Sciweavers

1088 search results - page 97 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
PRICAI
2000
Springer
14 years 2 months ago
Trading Off Granularity against Complexity
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
Ingrid Zukerman, David W. Albrecht, Ann E. Nichols...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 11 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
PPSN
2010
Springer
13 years 9 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
RIVF
2008
14 years 2 days ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...
PODC
2000
ACM
14 years 3 months ago
Debugging distributed programs using controlled re-execution
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
Neeraj Mittal, Vijay K. Garg