28888 search results - page 61 / 5778 » Computability and complexity in analysis |
SMA
2005
ACM
14 years 1 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
CSR
2008
Springer
13 years 8 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
SPRINGSIM
2010
13 years 6 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
ANSS
1999
IEEE
14 years 6 days ago
1999
IEEE
The results presented here are based on many years of experience of development and application of DYANA