Sciweavers

2925 search results - page 440 / 585
» Information Complexity of Online Problems
Sort
View
CLEF
2010
Springer
15 years 4 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 4 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
DEBU
2008
118views more  DEBU 2008»
15 years 4 months ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
CE
2007
99views more  CE 2007»
15 years 4 months ago
Self-organising navigational support in lifelong learning: How predecessors can lead the way
Increased flexibility and modularisation in higher education complicates the process of learners finding their way through the offerings of higher education institutions. In lifel...
José Janssen, Colin Tattersall, Wim Waterin...
JCM
2006
118views more  JCM 2006»
15 years 4 months ago
Joint Optimization of Local and Fusion Rules in a Decentralized Sensor Network
Decentralized sensor networks are collections of individual local sensors that observe a common phenomenon, quantize their observations, and send this quantized information to a ce...
Nithya Gnanapandithan, Balasubramaniam Natarajan