8298 search results - page 160 / 1660 » On the Complexity of Numerical Analysis |
206
Voted
JACM
2010
15 years 5 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
180
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
207
Voted
WEBI
2009
Springer
16 years 1 months ago
2009
Springer
The emergence of scale free and small world properties in real world complex networks has stimulated lots of activity in the field of network analysis. An example of such a netwo...
178
click to vote
COMPGEOM
2010
ACM
16 years 3 days ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
209
Voted
APSEC
2005
IEEE
16 years 20 days ago
2005
IEEE
The design and development of complex software systems is a difficult task, and it is not easy to ensure the quality of a developed software. The paper presents an architectural ...