Sciweavers

1282 search results - page 165 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
INFOCOM
2003
IEEE
15 years 9 months ago
Local Scheduling Policies in Networks of Packet Switches with Input Queues
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...
Marco Ajmone Marsan, Paolo Giaccone, Emilio Leonar...
CVPR
2012
IEEE
13 years 6 months ago
Image denoising: Can plain neural networks compete with BM3D?
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
AI
2010
Springer
15 years 4 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini
SSPR
2004
Springer
15 years 9 months ago
Optimizing Classification Ensembles via a Genetic Algorithm for a Web-Based Educational System
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 4 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...