6045 search results - page 990 / 1209 » Computable Linearizations of Well-partial-orderings |
165
click to vote
ISPD
2003
ACM
15 years 11 months ago
2003
ACM
Delay evaluation is always a crucial concern in the VLSI design and it becomes increasingly more critical in the nowadays deep-submicron technology. To obtain an accurate delay va...
217
click to vote
SI3D
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we present an automatic, runtime modeler for modeling realistic, animatable human bodies. A user can generate a new model or modify an existing one simply by inputt...
167
click to vote
BIRTHDAY
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
173
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...