Sciweavers

1713 search results - page 19 / 343
» Analysis of Procedure Splitability
Sort
View
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 8 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
POPL
2004
ACM
14 years 2 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
NIPS
2007
13 years 10 months ago
Second Order Bilinear Discriminant Analysis for single trial EEG analysis
Traditional analysis methods for single-trial classification of electroencephalography (EEG) focus on two types of paradigms: phase locked methods, in which the amplitude of the ...
Christoforos Christoforou, Paul Sajda, Lucas C. Pa...
IBPRIA
2003
Springer
14 years 2 months ago
Reducing Training Sets by NCN-based Exploratory Procedures
In this paper, a new approach to training set size reduction is presented. This scheme basically consists of defining a small number of prototypes that represent all the original ...
María Teresa Lozano, José Salvador S...
BMCBI
2005
99views more  BMCBI 2005»
13 years 9 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich