Sciweavers

14649 search results - page 2695 / 2930
» Principles of problem solving
Sort
View
JHSN
2000
92views more  JHSN 2000»
15 years 6 months ago
On a class of time varying shapers with application to the renegotiable variable bit rate service
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
Silvia Giordano
IDA
2002
Springer
15 years 6 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
KI
2002
Springer
15 years 6 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
MCS
2002
Springer
15 years 6 months ago
Multiclassifier Systems: Back to the Future
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
Joydeep Ghosh
« Prev « First page 2695 / 2930 Last » Next »