Sciweavers

895 search results - page 97 / 179
» Approximate convex decomposition
Sort
View
TSP
2008
178views more  TSP 2008»
14 years 9 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
SIAMSC
2010
116views more  SIAMSC 2010»
14 years 4 months ago
Optimized Schwarz Waveform Relaxation for the Primitive Equations of the Ocean
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
Emmanuel Audusse, Pierre Dreyfuss, Benoit Merlet
INFOCOM
2006
IEEE
15 years 3 months ago
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
Lijun Chen, Steven H. Low, Mung Chiang, John C. Do...
NETWORKING
2000
14 years 11 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
PR
2008
97views more  PR 2008»
14 years 9 months ago
SVD based initialization: A head start for nonnegative matrix factorization
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD c...
Christos Boutsidis, Efstratios Gallopoulos