Sciweavers

360 search results - page 43 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
FOGA
2011
13 years 2 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
HICSS
2002
IEEE
109views Biometrics» more  HICSS 2002»
14 years 3 months ago
An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks
In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless netwo...
Jie Wu
COMCOM
2008
127views more  COMCOM 2008»
13 years 11 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
VLSISP
2010
254views more  VLSISP 2010»
13 years 9 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
ICDE
2005
IEEE
145views Database» more  ICDE 2005»
14 years 4 months ago
Towards Indexing Schemes for Self-Tuning DBMS
Index tuning as part of database tuning is the task of selecting and creating indexes with the goal of reducing query processing times. However, in dynamic environments with vario...
Kai-Uwe Sattler, Eike Schallehn, Ingolf Geist