19866 search results - page 354 / 3974 » Computing all factorizations in *** |
191
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
169
click to vote
AICOM
2002
15 years 6 months ago
2002
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
174
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
232
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
173
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...