Sciweavers

1507 search results - page 232 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
WSC
2000
14 years 2 days ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
ARTMED
2006
80views more  ARTMED 2006»
13 years 10 months ago
A formal theory for spatial representation and reasoning in biomedical ontologies
Objective: The objective of this paper is to demonstrate how a formal spatial theory can be used as an important tool for disambiguating the spatial information embodied in biomed...
Maureen Donnelly, Thomas Bittner, Cornelius Rosse
VIS
2007
IEEE
80views Visualization» more  VIS 2007»
15 years 5 hour 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...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 11 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 3 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert