Sciweavers

6274 search results - page 199 / 1255
» From query complexity to computational complexity
Sort
View
CODES
2006
IEEE
15 years 6 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...
140
Voted
ICDCSW
2007
IEEE
15 years 11 months ago
Event Stream Processing with Out-of-Order Data Arrival
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
Ming Li, Mo Liu, Luping Ding, Elke A. Rundensteine...
EUROPAR
1999
Springer
15 years 8 months ago
On Disk Allocation of Intermediate Query Results in Parallel Database Systems
For complex queries in parallel database systems, substantial amounts of data must be redistributed between operators executed on different processing nodes. Frequently, such inter...
Holger Märtens
ECCB
2008
IEEE
15 years 4 months ago
Temporal logic patterns for querying dynamic models of cellular interaction networks
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
Pedro T. Monteiro, Delphine Ropers, Radu Mateescu,...
RECOMB
1998
Springer
15 years 8 months ago
On reconstructing species trees from gene trees in term of duplications and losses
This paper studies various properties of the least common ancestors mapping, the duplication and mutation costs, and the complexity of nding a species tree from gene trees.
Bin Ma, Ming Li, Louxin Zhang