Sciweavers

9719 search results - page 303 / 1944
» Answer Set Optimization
Sort
View
166
Voted
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
TSD
2010
Springer
15 years 5 months ago
Using Gradient Descent Optimization for Acoustics Training from Heterogeneous Data
In this paper, we study the use of heterogeneous data for training of acoustic models. In initial experiments, a significant drop of accuracy has been observed on in-domain test s...
Martin Karafiát, Igor Szöke, Jan Cerno...
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 11 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
15 years 11 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
FOCS
1995
IEEE
15 years 10 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby