Sciweavers

9405 search results - page 1294 / 1881
» Computing a Model of Set Theory
Sort
View
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
ESWA
2007
127views more  ESWA 2007»
15 years 7 months ago
Clustering support vector machines for protein local structure prediction
Understanding the sequence-to-structure relationship is a central task in bioinformatics research. Adequate knowledge about this relationship can potentially improve accuracy for ...
Wei Zhong, Jieyue He, Robert W. Harrison, Phang C....
JACM
2000
131views more  JACM 2000»
15 years 6 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
SAC
2010
ACM
16 years 1 months ago
Adaptive internet services through performance and availability control
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
Jean Arnaud, Sara Bouchenak
PLDI
2003
ACM
16 years 10 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
« Prev « First page 1294 / 1881 Last » Next »