Sciweavers

488 search results - page 82 / 98
» Automorphic Decompositions of Graphs
Sort
View
118
Voted
PC
2007
141views Management» more  PC 2007»
15 years 1 months ago
Physically based simulation of cloth on distributed memory architectures
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
Bernhard Thomaszewski, Wolfgang Blochinger
CORR
2010
Springer
209views Education» more  CORR 2010»
14 years 10 months ago
Generalized Tree-Based Wavelet Transform
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
Idan Ram, Michael Elad, Israel Cohen
ICML
2007
IEEE
16 years 2 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 2 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...
FOCS
2006
IEEE
15 years 8 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau