1209 search results - page 27 / 242 » Approximation by pseudo-linear operators |
86
Voted
JACM
2000
14 years 10 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
In this contribution, a novel spatio-temporal prediction algorithm for video coding is introduced. This algorithm exploits temporal as well as spatial redundancies for effectively...
78
Voted
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
ICDT
1995
ACM
15 years 1 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
82
Voted
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...