Sciweavers

3328 search results - page 234 / 666
» On Plateaued Functions and Their Constructions
Sort
View
FOCS
2008
IEEE
16 years 1 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
SIGGRAPH
1995
ACM
15 years 10 months ago
Realistic modeling for facial animation
A major unsolved problem in computer graphics is the construction and animation of realistic human facial models. Traditionally, facial models have been built painstakingly by man...
Yuencheng Lee, Demetri Terzopoulos, Keith Waters
ALGOSENSORS
2009
Springer
15 years 4 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CVPR
2012
IEEE
13 years 9 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
CVPR
2012
IEEE
13 years 9 months ago
Discrete texture traces: Topological representation of geometric context
Modeling representations of image patches that are quasi-invariant to spatial deformations is an important problem in computer vision. In this paper, we propose a novel concept, t...
Jan Ernst, Maneesh Kumar Singh, Visvanathan Ramesh