Sciweavers

329 search results - page 59 / 66
» Uniform variable splitting
Sort
View
UIST
1993
ACM
15 years 3 months ago
VB2: An Architecture for Interaction in Synthetic Worlds
This paper describes the VB2 architecture for the construction of three-dimensional interactive applications. The system's state and behavior are uniformly represented as a n...
Enrico Gobbetti, Jean-Francis Balaguer, Daniel Tha...
EUROPAR
2006
Springer
15 years 3 months ago
Context Awareness: An Experiment with Hoarding
Abstract. Computer mobility allows people to use computers in varied and changing environments. This variability forces applications to adapt thus requiring awareness of the comput...
João Garcia, Luís Veiga, Paulo Ferre...
93
Voted
NIPS
1997
15 years 1 months ago
Computing with Action Potentials
Most computational engineering based loosely on biology uses continuous variables to represent neural activity. Yet most neurons communicate with action potentials. The engineerin...
John J. Hopfield, Carlos D. Brody, Sam T. Roweis
CCE
2004
14 years 11 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
CPC
1999
105views more  CPC 1999»
14 years 11 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill