Sciweavers

329 search results - page 55 / 66
» New lower bounds for some spherical designs
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
ICCV
2003
IEEE
14 years 9 months ago
Surface Reconstruction by Integrating 3D and 2D Data of Multiple Views
Surface representation is needed for almost all modeling and visualization applications, but unfortunately, 3D data from a passive vision system are often insufficient for a tradi...
Maxime Lhuillier, Long Quan
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
13 years 11 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 4 months ago
Comparing Prediction Market Structures, With an Application to Market Making
Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed ...
Aseem Brahma, Sanmay Das, Malik Magdon-Ismail