594 search results - page 17 / 119 » Using Approximation to Relate Computational Classes over the... |
CASC
2009
Springer
14 years 3 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
SIAMCOMP
2010
13 years 7 months ago
2010
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
ACS
2010
13 years 8 months ago
2010
The class Md of sequentially dense monomorphisms were first defined and studied by Giuli, Ebrahimi, and Mahmoudi for projection algebras (acts over the monoid (N , min), of interes...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...