1431 search results - page 49 / 287 » The complexity of random ordered structures |
201
Voted
ADAEUROPE
2003
Springer
16 years 8 days ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
188
Voted
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
187
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
151
Voted
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
151
click to vote
AIED
2005
Springer
16 years 18 days ago
2005
Springer
This paper presents an approach to generate structured explanations of system behaviour based on qualitative simulations. This has been implemented in WiziGarp, a domain-independen...