Sciweavers

263 search results - page 45 / 53
» Regret Bounds for Prediction Problems
Sort
View
JMLR
2011
148views more  JMLR 2011»
14 years 4 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
81
Voted
DSN
2005
IEEE
15 years 3 months ago
How Resilient are Distributed f Fault/Intrusion-Tolerant Systems?
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...
BMCBI
2010
102views more  BMCBI 2010»
14 years 9 months ago
Missing genes in the annotation of prokaryotic genomes
Background: Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports...
Andrew S. Warren, Jeremy S. Archuleta, Wu-chun Fen...
WWW
2009
ACM
15 years 10 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
NOCS
2008
IEEE
15 years 3 months ago
Real-Time Communication Analysis for On-Chip Networks with Wormhole Switching
Abstract— In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach i...
Zheng Shi, Alan Burns