Sciweavers

2520 search results - page 155 / 504
» The complexity of approximating entropy
Sort
View
93
Voted
FGR
2008
IEEE
165views Biometrics» more  FGR 2008»
15 years 19 days 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
14 years 12 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»
14 years 11 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...
101
Voted
ISCI
2000
84views more  ISCI 2000»
14 years 10 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 ...
ECRTS
2009
IEEE
14 years 8 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan