Sciweavers

2569 search results - page 18 / 514
» Approximate Objects and Approximate Theories
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
14 years 11 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
COMPGEOM
2011
ACM
14 years 3 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
WACV
2005
IEEE
15 years 5 months ago
Temporal Synchronization of Video Sequences in Theory and in Practice
— In this work, we present a formalization of the video synchronization problem that exposes new variants of the problem that have been left unexplored to date. We also present a...
Anthony Whitehead, Robert Laganière, Prosen...
ECSQARU
2001
Springer
15 years 4 months ago
New Semantics for Quantitative Possibility Theory
New semantics for numerical values given to possibility measures are provided. For epistemic possibilities, the new approach is based on the semantics of the transferable belief m...
Didier Dubois, Henri Prade, Philippe Smets
MP
2006
107views more  MP 2006»
14 years 11 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint