Sciweavers

19320 search results - page 208 / 3864
» On the complexity of computing determinants
Sort
View
DSOM
2006
Springer
15 years 10 months ago
Detecting Bottleneck in n-Tier IT Applications Through Analysis
As the complexity of large-scale enterprise applications increases, providing performance verification through staging becomes an important part of reducing business risks associat...
Gueyoung Jung, Galen S. Swint, Jason Parekh, Calto...
DAC
1997
ACM
15 years 10 months ago
SPIE: Sparse Partial Inductance Extraction
Extracting the inductance of complex interconnect topologies is a formidable task, and simulating the resulting dense partial inductance matrix is even more difficult. Furthermore...
Zhijiang He, Mustafa Celik, Lawrence T. Pileggi
SOFSEM
2000
Springer
15 years 10 months ago
Hierarchies of Sensing and Control in Visually Guided Agents
The capability of perceiving the environment is crucial for advancing the level of autonomy and sophistication of (semi)autonomous robotic systems and determines the complexity of ...
Jana Kosecka
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
COMGEO
2008
ACM
15 years 6 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff