Sciweavers

5595 search results - page 832 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
TNN
2008
82views more  TNN 2008»
15 years 6 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
SEAL
2010
Springer
15 years 4 months ago
Dominance-Based Pareto-Surrogate for Multi-Objective Optimization
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
ICASSP
2011
IEEE
14 years 10 months ago
Dynamic spectrum management in DSL with asynchronous crosstalk
Dynamic spectrum management (DSM) aims to optimally allocate per-user transmit spectra so that the effect of multiuser interference (crosstalk) is minimized and the capabilities o...
Rodrigo B. Moraes, Paschalis Tsiaflakis, Marc Moon...
WAIM
2007
Springer
16 years 24 days ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
162
Voted
ICPPW
2002
IEEE
15 years 11 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen