Sciweavers

1092 search results - page 135 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
PAMI
1998
128views more  PAMI 1998»
15 years 5 months ago
A Hierarchical Latent Variable Model for Data Visualization
—Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projec...
Christopher M. Bishop, Michael E. Tipping
TIP
2010
176views more  TIP 2010»
15 years 29 days ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
FOCS
2008
IEEE
16 years 21 days ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
MOBICOM
2003
ACM
15 years 11 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
15 years 11 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...