Sciweavers

933 search results - page 184 / 187
» Monotone Complexity of a Pair
Sort
View
SAC
2008
ACM
13 years 7 months ago
A biologically inspired generation of virtual characters
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
Roberto C. Cavalcante Vieira, Creto Augusto Vidal,...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 6 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
LATIN
2010
Springer
13 years 5 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
STVR
2010
99views more  STVR 2010»
13 years 5 months ago
Fault localization based on information flow coverage
Failures triggered by hard to debug defects usually involve complex interactions between many program elements. We hypothesize that information flows present a good model for such ...
Wes Masri
TIFS
2010
184views more  TIFS 2010»
13 years 5 months ago
Information-theoretically secret key generation for fading wireless channels
—The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, ...
Chunxuan Ye, Suhas Mathur, Alex Reznik, Yogendra S...