Sciweavers

7930 search results - page 385 / 1586
» Greedy in Approximation Algorithms
Sort
View
174
Voted
ICML
2004
IEEE
16 years 7 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 6 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
CISS
2008
IEEE
16 years 1 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
145
Voted
EGH
2007
Springer
16 years 28 days ago
Exact and error-bounded approximate color buffer compression and decompression
In this paper, we first present a survey of existing color buffer compression algorithms. After that, we introduce a new scheme based on an exactly reversible color transform, si...
Jim Rasmusson, Jon Hasselgren, Tomas Akenine-M&oum...
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
16 years 7 days ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...