Sciweavers

1653 search results - page 323 / 331
» Computer science and game theory
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
SIGECOM
2009
ACM
118views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Modeling volatility in prediction markets
There is significant experimental evidence that prediction markets are efficient mechanisms for aggregating information and are more accurate in forecasting events than tradition...
Nikolay Archak, Panagiotis G. Ipeirotis
GECCO
2007
Springer
165views Optimization» more  GECCO 2007»
14 years 1 months ago
Peptide detectability following ESI mass spectrometry: prediction using genetic programming
The accurate quantification of proteins is important in several areas of cell biology, biotechnology and medicine. Both relative and absolute quantification of proteins is often d...
David C. Wedge, Simon J. Gaskell, Simon J. Hubbard...
SENSYS
2006
ACM
14 years 1 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
COMPGEOM
2004
ACM
14 years 29 days ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu