Sciweavers

1920 search results - page 323 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
INFOVIS
2005
IEEE
15 years 3 months ago
PRISAD: A Partitioned Rendering Infrastructure for Scalable Accordion Drawing
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
James Slack, Kristian Hildebrand, Tamara Munzner
IMC
2007
ACM
14 years 11 months ago
Understanding the limitations of transmit power control for indoor wlans
A wide range of transmit power control (TPC) algorithms have been proposed in recent literature to reduce interference and increase capacity in 802.11 wireless networks. However, ...
Vivek Shrivastava, Dheeraj Agrawal, Arunesh Mishra...
BMCBI
2008
129views more  BMCBI 2008»
14 years 10 months ago
A unified approach to false discovery rate estimation
Background: False discovery rate (FDR) methods play an important role in analyzing highdimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as ...
Korbinian Strimmer
SADM
2008
178views more  SADM 2008»
14 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
CVPR
2009
IEEE
16 years 4 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...