2621 search results - page 289 / 525 » Near orders and codes |
178
Voted
CAP
2010
15 years 1 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
205
click to vote
ASPDAC
2011
ACM
14 years 10 months ago
2011
ACM
This paper studies realization and performance comparison of the sequential and weak consistency models in the network-on-chip (NoC) based distributed shared memory (DSM) multi-cor...
222
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
143
click to vote
ICIP
1995
IEEE
16 years 8 months ago
1995
IEEE
This paper presents mathematical frameworks on temporal predictiveprocessing in the MPEG video compression standard. Firstly, a coding gain is derived based on traditional predict...
148
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
We construct large caps in projective spaces of small dimension (up to 11) defined over fields of order at most 9. The constructions are both theoretical and computer-supported. S...