Sciweavers

15485 search results - page 366 / 3097
» Computing Optimal Subsets
Sort
View
TSP
2008
134views more  TSP 2008»
15 years 6 months ago
Computational Algorithms for Wavelet Identification of Nonlinearities in Hammerstein Systems With Random Inputs
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
Przemyslaw Sliwinski, Zygmunt Hasiewicz
149
Voted
RC
2007
83views more  RC 2007»
15 years 6 months ago
Computing the Pessimism of Inclusion Functions
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
Gilles Chabert, Luc Jaulin
TRANSCI
2010
101views more  TRANSCI 2010»
15 years 5 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu

Publication
304views
17 years 5 months ago
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with Connectionless Network Layer
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the ...
K. Ramakrishnan and R. Jain
ICCV
2009
IEEE
16 years 11 months ago
Large Displacement Optical Flow Computation without Warping
We propose an algorithm for large displacement opti- cal flow estimation which does not require the commonly used coarse-to-fine warping strategy. It is based on a quadratic rel...
Frank Steinbrucker, Thomas Pock, Daniel Cremers