Sciweavers

2957 search results - page 266 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde,...
FGR
2008
IEEE
165views Biometrics» more  FGR 2008»
15 years 8 months ago
Efficient approximations to model-based joint tracking and recognition of continuous sign language
We propose several tracking adaptation approaches to recover from early tracking errors in sign language recognition by optimizing the obtained tracking paths w.r.t. to the hypoth...
Philippe Dreuw, Jens Forster, Thomas Deselaers, He...
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
APAL
2008
69views more  APAL 2008»
15 years 6 months ago
Lowness properties and approximations of the jump
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
Santiago Figueira, André Nies, Frank Stepha...
ISCI
2000
84views more  ISCI 2000»
15 years 6 months ago
Automating the approximate record-matching process
Data Quality has many dimensions one of which is accuracy. Accuracy is usually compromised by errors accidentally or intensionally introduced in a database system. These errors re...
Vassilios S. Verykios, Ahmed K. Elmagarmid, Elias ...