Sciweavers

276 search results - page 8 / 56
» Universal multi-dimensional scaling
Sort
View
SIGGRAPH
1993
ACM
15 years 3 months ago
Radioptimization: goal based rendering
This paper presents a method for designing the illumination in an environment using optimization techniques applied to a radiosity based image synthesis system. An optimization of...
John K. Kawai, James S. Painter, Michael F. Cohen
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 12 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
BMCBI
2010
125views more  BMCBI 2010»
14 years 12 months ago
NeatMap - non-clustering heat map alternatives in R
Background: The clustered heat map is the most popular means of visualizing genomic data. It compactly displays a large amount of data in an intuitive format that facilitates the ...
Satwik Rajaram, Yoshi Oono
INFOCOM
2012
IEEE
13 years 2 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 4 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson