Sciweavers

1312 search results - page 198 / 263
» Formally Optimal Boxing
Sort
View
ICML
2006
IEEE
14 years 11 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
ICML
1999
IEEE
14 years 11 months ago
Using Reinforcement Learning to Spider the Web Efficiently
Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...
Jason Rennie, Andrew McCallum
SIGSOFT
2007
ACM
14 years 11 months ago
Object and reference immutability using java generics
A compiler-checked immutability guarantee provides useful documentation, facilitates reasoning, and enables optimizations. This paper presents Immutability Generic Java (IGJ), a n...
Yoav Zibin, Alex Potanin, Mahmood Ali, Shay Artzi,...
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
14 years 10 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
CHI
2008
ACM
14 years 10 months ago
K-sketch: a 'kinetic' sketch pad for novice animators
Because most animation tools are complex and timeconsuming to learn and use, most animations today are created by experts. To help novices create a wide range of animations quickl...
Richard C. Davis, Brien Colwell, James A. Landay