29908 search results - page 32 / 5982 » On the Complexity of |
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— It is well known that complex networks have become a very important part of our daily lives and have been intensively studied in all fields over the last few years. This paper...
COMPGEOM
2010
ACM
14 years 23 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...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we describe the process of mining complex relationships in spatial databases using the Maximal Participation Index (maxPI), which has a property of discovering low s...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...