Sciweavers

10901 search results - page 274 / 2181
» Approximations in Distributed Optimization
Sort
View
FUIN
2002
108views more  FUIN 2002»
15 years 6 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
POPL
2007
ACM
16 years 7 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
ADC
2006
Springer
136views Database» more  ADC 2006»
16 years 19 days ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
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...
JOI
2007
99views more  JOI 2007»
15 years 6 months ago
Measuring quality of similarity functions in approximate data matching
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
Roberto da Silva, Raquel Kolitski Stasiu, Viviane ...