Sciweavers

54 search results - page 8 / 11
» On Approximating the Entropy of Polynomial Mappings
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
JUCS
2006
112views more  JUCS 2006»
13 years 7 months ago
Construction of Wavelets and Applications
: A sequence of increasing translation invariant subspaces can be defined by the Haar-system (or generally by wavelets). The orthogonal projection to the subspaces generates a deco...
Ildikó László, Ferenc Schipp,...
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
13 years 7 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...
RECOMB
2006
Springer
14 years 7 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 1 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...