383 search results - page 11 / 77 » The Study of 3D-from-2D Using Elimination |
TCS
2008
14 years 11 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
113
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
115
click to vote
AAAI
2011
13 years 11 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
104
click to vote
WSC
2008
15 years 2 months ago
2008
This research presents an integrated simulation modelingDesign For Six Sigma (DFSS) framework to study the design and process issues in a server manufacturing environment. The ser...
103
click to vote
AISC
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...