Sciweavers

3946 search results - page 226 / 790
» The computational complexity of choice sets
Sort
View
FOCS
2003
IEEE
15 years 12 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
SIGGRAPH
1994
ACM
15 years 10 months ago
Computer-generated pen-and-ink illustration
This paper describes the principles of traditional pen-and-ink illustration, and shows how a great number of them can be implemented as part of an automated rendering system. It i...
Georges Winkenbach, David Salesin
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
CVPR
2012
IEEE
13 years 9 months ago
Two-person interaction detection using body-pose features and multiple instance learning
Human activity recognition has potential to impact a wide range of applications from surveillance to human computer interfaces to content based video retrieval. Recently, the rapi...
Kiwon Yun, Jean Honorio, Debaleena Chattopadhyay, ...
PRL
2011
15 years 1 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino