Sciweavers

882 search results - page 76 / 177
» On self-embeddings of computable linear orderings
Sort
View
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 4 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
BIBE
2008
IEEE
204views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
2D Oculomotor Plant Mathematical Model for eye movement simulation
-This paper builds a two dimensional Oculomotor Plant Mathematical Model (2DOPMM) that is capable of generating eye movement trace on a two dimensional plane. The key difference be...
Oleg Komogortsev, Ukwatta K. S. Jayarathna
WSC
1998
14 years 11 months ago
Sequential Allocations that Reduce Risk for Multiple Comparisons
We consider how to efficiently allocate computing resources in order to infer the best of a finite set of simulated systems, where best means that the system has the maximal expec...
Stephen E. Chick, Koichiro Inoue
ICCV
2011
IEEE
13 years 10 months ago
Learning a Category Independent Object Detection Cascade
Cascades are a popular framework to speed up object detection systems. Here we focus on the first layers of a category independent object detection cascade in which we sample a l...
Esa Rahtu, Juho Kannala, Matthew Blaschko