Sciweavers

1147 search results - page 184 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
ICCSA
2004
Springer
14 years 1 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
SIROCCO
2000
13 years 9 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
MOBIHOC
2006
ACM
14 years 7 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
14 years 9 months ago
SWAT: Hierarchical Stream Summarization in Large Networks
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
Ahmet Bulut, Ambuj K. Singh
BMCBI
2008
82views more  BMCBI 2008»
13 years 7 months ago
Standardized high-throughput evaluation of cell-based compound screens
Background: High-throughput screening of pharmaceutical compound activity in tissue culture experiments requires time-consuming repeated analysis of the large amounts of data gene...
Peter Frommolt, Roman K. Thomas