38 search results - page 7 / 8 » Extending Polynomial Chaos to Include Interval Analysis |
SMI
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
CGF
2010
13 years 7 months ago
2010
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
PERVASIVE
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. Accurate and fine-grained prediction of future user location and geographical profile has interesting and promising applications including targeted content service, adv...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...