Sciweavers

522 search results - page 10 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
BMCBI
2008
110views more  BMCBI 2008»
13 years 8 months ago
Determining significance of pairwise co-occurrences of events in bursty sequences
Background: Event sequences where different types of events often occur close together arise, e.g., when studying potential transcription factor binding sites (TFBS, events) of ce...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
ICSE
2010
IEEE-ACM
13 years 9 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
SPIN
2004
Springer
14 years 1 months ago
Formal Analysis of Processor Timing Models
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
Reinhard Wilhelm
GLOBECOM
2008
IEEE
14 years 2 months ago
Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
Ernesto Zimmermann, David L. Milliner, John R. Bar...
ALT
2000
Springer
14 years 6 days ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata