Sciweavers

322 search results - page 41 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 5 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
INFOCOM
1998
IEEE
13 years 12 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
ENTCS
2002
72views more  ENTCS 2002»
13 years 7 months ago
A Symbolic Out-of-Core Solution Method for Markov Models
Despite considerable effort, the state-space explosion problem remains an issue in the analysis of Markov models. Given structure, symbolic representations can result in very comp...
Marta Z. Kwiatkowska, Rashid Mehmood, Gethin Norma...
TSMC
2008
148views more  TSMC 2008»
13 years 7 months ago
Stratification Approach for 3-D Euclidean Reconstruction of Nonrigid Objects From Uncalibrated Image Sequences
Abstract--This paper addresses the problem of 3-D reconstruction of nonrigid objects from uncalibrated image sequences. Under the assumption of affine camera and that the nonrigid ...
Guanghui Wang, Q. M. Jonathan Wu