Sciweavers

9842 search results - page 1688 / 1969
» Problem complexity
Sort
View
CLEF
2010
Springer
15 years 6 months ago
Random Sampling Image to Class Distance for Photo Annotation
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
Deyuan Zhang, Bingquan Liu, Chengjie Sun, Xiaolong...
ICASSP
2010
IEEE
15 years 6 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
ICASSP
2010
IEEE
15 years 6 months ago
Towards large scale distributed coding
This paper considers the problem of distributed source coding for a large sensor network. A typical shortcoming of current approaches to true distributed coding is the exponential...
Sharadh Ramaswamy, Kumar Viswanatha, Ankur Saxena,...
ICASSP
2010
IEEE
15 years 6 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 6 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
« Prev « First page 1688 / 1969 Last » Next »