Sciweavers

58 search results - page 11 / 12
» Do knobs have character
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
ICMCS
2006
IEEE
144views Multimedia» more  ICMCS 2006»
13 years 11 months ago
TV Commercial Classification by using Multi-Modal Textual Information
In this paper, we propose an approach for TV commercial video classification by the categories of advertised products or services (e.g. automobiles, healthcare products, etc). Sin...
Yantao Zheng, Lingyu Duan, Qi Tian, Jesse S. Jin
SIGIR
2005
ACM
13 years 11 months ago
Boosted decision trees for word recognition in handwritten document retrieval
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
Nicholas R. Howe, Toni M. Rath, R. Manmatha
USS
2004
13 years 6 months ago
TIED, LibsafePlus: Tools for Runtime Buffer Overflow Protection
Buffer overflow exploits make use of the treatment of strings in C as character arrays rather than as first-class objects. Manipulation of arrays as pointers and primitive pointer...
Kumar Avijit, Prateek Gupta, Deepak Gupta
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...