Sciweavers

322 search results - page 14 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
ICASSP
2011
IEEE
12 years 11 months ago
An adaptive time-frequency resolution approach for Non-negative Matrix Factorization based single channel sound source separatio
In this paper, we propose an adaptive time-frequency resolution approach for the single channel source separation problem. The aim is to improve the quality and intelligibility of...
Serap Kirbiz, Paris Smaragdis
JAIR
2011
123views more  JAIR 2011»
13 years 2 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
14 years 26 days ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak