Sciweavers

1185 search results - page 32 / 237
» The Equivalence of Sampling and Searching
Sort
View
ICIP
2007
IEEE
13 years 11 months ago
Finding Optimal Integral Sampling Lattices for a given Frequency Support in Multidimensions
The search for alias-free sampling lattices for a given frequency support, in particular those lattices achieving minimum sampling densities, is a fundamental issue in various app...
Yue M. Lu, Minh N. Do
EUROCAST
2009
Springer
179views Hardware» more  EUROCAST 2009»
14 years 2 months ago
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
APWEB
2006
Springer
13 years 11 months ago
Sample Sizes for Query Probing in Uncooperative Distributed Information Retrieval
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...
Milad Shokouhi, Falk Scholer, Justin Zobel
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 7 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
14 years 1 months ago
Addressing sampling errors and diversity loss in UMDA
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
Jürgen Branke, Clemens Lode, Jonathan L. Shap...