Sciweavers

2925 search results - page 163 / 585
» Information Complexity of Online Problems
Sort
View
JMLR
2002
135views more  JMLR 2002»
15 years 6 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang
NAR
2008
67views more  NAR 2008»
15 years 6 months ago
EpiToolKit - a web server for computational immunomics
Predicting the T-cell-mediated immune response is an important task in vaccine design and thus one of the key problems in computational immunomics. Various methods have been devel...
Magdalena Feldhahn, Philipp Thiel, Mathias M. Schu...
ICCV
2009
IEEE
6637views Computer Vision» more  ICCV 2009»
16 years 11 months ago
A Markov Clustering Topic Model for Mining Behaviour in Video
This paper addresses the problem of fully automated mining of public space video data. A novel Markov Clustering Topic Model (MCTM) is introduced which builds on existing Dynami...
Timothy Hospedales, Shaogang Gong, Tao Xiang
ESOP
2010
Springer
16 years 3 months ago
Precise and Automated Contract-based Reasoning for Verification and Certification of Information Flow Properties of Programs wit
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
Torben Amtoft, John Hatcliff and Edwin Rodríguez
WIDM
1999
ACM
15 years 10 months ago
An Efficient Plan Execution System for Information Management Agents
Recent work on information integration has yielded novel and efficient solutions for gathering data from the World Wide Web. However, there has been little attention given to the ...
Greg Barish, Dan DiPasquo, Craig A. Knoblock, Stev...