Sciweavers

3096 search results - page 4 / 620
» The Generalized FITC Approximation
Sort
View
DAM
1999
132views more  DAM 1999»
13 years 8 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
MOC
2002
83views more  MOC 2002»
13 years 8 months ago
A posteriori error estimates for general numerical methods for Hamilton-Jacobi equations. Part I: The steady state case
A new upper bound is provided for the L-norm of the difference between the viscosity solution of a model steady state Hamilton-Jacobi equation, u, and any given approximation, v. T...
Samuel Albert, Bernardo Cockburn, Donald A. French...
TMC
2010
196views more  TMC 2010»
13 years 7 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
ICCV
2009
IEEE
13 years 6 months ago
Kernel map compression using generalized radial basis functions
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
Omar Arif, Patricio A. Vela
RSCTC
1998
Springer
129views Fuzzy Logic» more  RSCTC 1998»
14 years 23 days ago
On Generalizing Pawlak Approximation Operators
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
Y. Y. Yao