364 search results - page 58 / 73 » Very Efficient Balanced Codes |
DEBS
2008
ACM
13 years 9 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ICN
2001
Springer
14 years 10 days ago
2001
Springer
The current VoIP transfer methods using low bit rate codes such as G.723.1 and G.729 are still very inefficient due to its small payload size in comparison with its large overhead ...
PAMI
2008
13 years 7 months ago
2008
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
As a recently proposed technique, sparse representation based classification (SRC) has been widely used for face recognition (FR). SRC first codes a testing sample as a sparse lin...