Sciweavers

1435 search results - page 67 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
MM
2010
ACM
174views Multimedia» more  MM 2010»
14 years 10 months ago
Image classification using the web graph
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
Dhruv Kumar Mahajan, Malcolm Slaney
IJBRA
2007
97views more  IJBRA 2007»
14 years 9 months ago
Structural Risk Minimisation based gene expression profiling analysis
: For microarray based cancer classification, feature selection is a common method for improving classifier generalisation. Most wrapper methods use cross validation methods to eva...
Xue-wen Chen, Byron Gerlach, Dechang Chen, ZhenQiu...
CP
2011
Springer
13 years 9 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
SIGMETRICS
2005
ACM
101views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
Fundamental bounds on the accuracy of network performance measurements
This paper considers the basic problem of “how accurate can we make Internet performance measurements”. The answer is somewhat counter-intuitive in that there are bounds on th...
Matthew Roughan