Sciweavers

3894 search results - page 397 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 4 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
156
Voted
TSP
2008
129views more  TSP 2008»
15 years 3 months ago
A Basic Convergence Result for Particle Filtering
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
Xiao-Li Hu, Thomas B. Schön, Lennart Ljung
CVPR
1999
IEEE
16 years 7 months ago
Estimation of Epipolar Geometry from Apparent Contours: Affine and Circular Motion Cases
This paper addresses the problem of estimating the epipolar geometry from apparent contours in two special cases: under weak perspective and for circular motion. An appropriate pa...
Paulo R. S. Mendonça, Roberto Cipolla
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
16 years 1 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...