Sciweavers

1280 search results - page 87 / 256
» Soft Typing with Conditional Types
Sort
View
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
13 years 8 months ago
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
Luc Devroye
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 4 months ago
Uniqueness domains and non singular assembly mode changing trajectories
- Parallel robots admit generally several solutions to the direct kinematics problem. The aspects are associated with the maximal singularity free domains without any singular conf...
Damien Chablat, Guillaume Moroz, Philippe Wenger
PC
2011
314views Management» more  PC 2011»
13 years 4 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...
AMC
2011
13 years 23 days ago
General criteria for asymptotic and exponential stabilities of neural network models with unbounded delays
For a family of differential equations with infinite delay, we give sufficient conditions for the global asymptotic, and global exponential stability of an equilibrium point. Th...
Teresa Faria, José J. Oliveira
ICA
2012
Springer
12 years 4 months ago
Contrast Functions for Independent Subspace Analysis
We consider the Independent Subspace Analysis problem from the point of view of contrast functions, showing that contrast functions are able to partially solve the ISA problem. Tha...
Jason A. Palmer, Scott Makeig