Sciweavers

1632 search results - page 81 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 5 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
CCS
2008
ACM
15 years 5 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
ICML
2005
IEEE
16 years 4 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
ICDE
1998
IEEE
142views Database» more  ICDE 1998»
16 years 4 months ago
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
Nick Koudas, Kenneth C. Sevcik
190
Voted
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
15 years 9 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini