Sciweavers

15416 search results - page 401 / 3084
» Embeddings of Computable Structures
Sort
View
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
16 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
VIS
2007
IEEE
80views Visualization» more  VIS 2007»
16 years 9 months ago
Topologically Clean Distance Fields
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...
Attila G. Gyulassy, Mark A. Duchaineau, Vijay Na...
JSA
2000
175views more  JSA 2000»
15 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
CVPR
2007
IEEE
16 years 9 months ago
Inferring Grammar-based Structure Models from 3D Microscopy Data
Joseph Schlecht, Kobus Barnard, Ekaterina Spriggs,...