Sciweavers

8431 search results - page 1367 / 1687
» Algorithmically Independent Sequences
Sort
View
EOR
2008
78views more  EOR 2008»
15 years 6 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
CAD
2006
Springer
15 years 6 months ago
A rational extension of Piegl's method for filling n-sided holes
N-sided hole filling plays an important role in vertex blending. To deal with the case that the corner is surrounded by rational surfaces (i.e. NURBS surfaces), an algorithm to fi...
Yi-Jun Yang, Jun-Hai Yong, Hui Zhang, Jean-Claude ...
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer
CVIU
2006
171views more  CVIU 2006»
15 years 6 months ago
Free viewpoint action recognition using motion history volumes
Action recognition is an important and challenging topic in computer vision, with many important applications including video surveillance, automated cinematography and understand...
Daniel Weinland, Rémi Ronfard, Edmond Boyer
EAAI
2006
157views more  EAAI 2006»
15 years 6 months ago
Blind source separation based on self-organizing neural network
This contribution describes a neural network that self-organizes to recover the underlying original sources from typical sensor signals. No particular information is required abou...
Anke Meyer-Bäse, Peter Gruber, Fabian J. Thei...
« Prev « First page 1367 / 1687 Last » Next »