Sciweavers

1418 search results - page 90 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
154
Voted
FAC
2010
106views more  FAC 2010»
15 years 1 months ago
Automatic verification of Java programs with dynamic frames
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
Jan Smans, Bart Jacobs, Frank Piessens, Wolfram Sc...
ESANN
2007
15 years 5 months ago
Order in Complex Systems of Nonlinear Oscillators: Phase Locked Subspaces
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
Jan-Hendrik Schleimer, Ricardo Vigário
BMCBI
2006
137views more  BMCBI 2006»
15 years 4 months ago
Curation of complex, context-dependent immunological data
Background: The Immune Epitope Database and Analysis Resource (IEDB) is dedicated to capturing, housing and analyzing complex immune epitope related data http:// www.immuneepitope...
Randi Vita, Kerrie Vaughan, Laura Zarebski, Nima S...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 4 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
LISP
2008
96views more  LISP 2008»
15 years 4 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal