Sciweavers

56 search results - page 8 / 12
» Extended Boolean Matrix Decomposition
Sort
View
ECCV
2000
Springer
15 years 11 months ago
Plane+Parallax, Tensors and Factorization
Abstract. We study the special form that the general multi-image tensor formalism takes under the plane + parallax decomposition, including matching tensors and constraints, closur...
Bill Triggs
CPAIOR
2010
Springer
15 years 23 days ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
COMCOM
2010
112views more  COMCOM 2010»
14 years 9 months ago
Birkhoff-von Neumann switching with statistical traffic profiles
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
Jerry Chi-Yuan Chou, Bill Lin
INFOCOM
2003
IEEE
15 years 2 months ago
On Guaranteed Smooth Scheduling For Input-Queued Switches
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman...
190
Voted
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 days 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