13603 search results - page 100 / 2721 » On the Complexity of Computing Treelength |
JC
2011
13 years 4 months ago
2011
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
TSP
2010
13 years 3 months ago
2010
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
TOG
2012
11 years 11 months ago
2012
We present a motion synthesis framework capable of producing a wide variety of important human behaviors that have rarely been studied, including getting up from the ground, crawl...
COMGEO
2008
ACM
13 years 9 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...