Sciweavers

249 search results - page 36 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
VIS
2004
IEEE
178views Visualization» more  VIS 2004»
14 years 10 months ago
Depth Enhanced Panoramas
Depth enhanced panoramas are a practical solution to the difficult problem of inside-looking-out modeling. Depth enhanced panoramas extend color panoramas to support viewpoint tra...
Gleb Bahmutov, Voicu Popescu, Elisha Sacks
COCOA
2009
Springer
14 years 1 months ago
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
Yi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans
TOG
2008
174views more  TOG 2008»
13 years 9 months ago
A mass spring model for hair simulation
Our goal is to simulate the full hair geometry, consisting of approximately one hundred thousand hairs on a typical human head. This will require scalable methods that can simulat...
Andrew Selle, Michael Lentine, Ronald Fedkiw
CGF
2011
13 years 19 days ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
PIMRC
2010
IEEE
13 years 7 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang