2485 search results - page 248 / 497 » Time Bounded Frequency Computations |
JC
2008
13 years 8 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
JMLR
2006
13 years 8 months ago
2006
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
WCET
2010
13 years 6 months ago
2010
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
SIGGRAPH
2010
ACM
14 years 25 days ago
2010
ACM
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...