644 search results - page 101 / 129 » Decomposition Complexity |
115
Voted
VISSYM
2007
15 years 2 months ago
2007
We present a fast hardware-accelerated stippling method which does not require any preprocessing for placing points on surfaces. The surfaces are automatically parameterized in or...
AAAI
2007
15 years 2 months ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
100
click to vote
VAMOS
2010
Springer
15 years 1 months ago
2010
Springer
Feature models are a common way to represent variability in software product line engineering. For this purpose, most authors use a graphical notation based on FODA. The main drawb...
89
Voted
IWPT
2001
15 years 1 months ago
2001
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
MASCOTS
2001
15 years 1 months ago
2001
Enterprise storage systems depend on disk arrays for their capacity and availability needs. To design and maintain storage systems that efficiently satisfy evolving requirements, ...