Sciweavers

2128 search results - page 397 / 426
» A general characterization of indulgence
Sort
View
SAFECOMP
1998
Springer
14 years 2 months ago
An Agenda for Specifying Software Components with Complex Data Models
Abstract. We present a method to specify software for a special kind of safetycritical embedded systems, where sensors deliver low-level values that must be abstracted and pre-proc...
Kirsten Winter, Thomas Santen, Maritta Heisel
RECOMB
1997
Springer
14 years 2 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 2 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
RULES
1993
Springer
134views Database» more  RULES 1993»
14 years 1 months ago
Temporal Rule Specification and Management in Object-oriented Knowledge Bases
There have been many recent research efforts on temporal databases for managing current and historical data and on active databases for monitoring real-world events as well as dat...
Stanley Y. W. Su, Hsin-Hsing M. Chen
FSTTCS
1992
Springer
14 years 1 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami