Sciweavers

13026 search results - page 2171 / 2606
» Probabilistic Relational Models
Sort
View
226
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
193
Voted
DBPL
1989
Springer
165views Database» more  DBPL 1989»
15 years 11 months ago
Support for Data-Intensive Applications: Conceptual Design and Software Development
In the process of developing an Information System, one passes through stages that include requirements gathering, design specification, and software implementation. The purpose ...
Alexander Borgida, John Mylopoulos, Joachim W. Sch...
185
Voted
DAC
2010
ACM
15 years 10 months ago
TSV stress aware timing analysis with applications to 3D-IC layout optimization
As the geometry shrinking faces severe limitations, 3D wafer stacking with through silicon via (TSV) has gained interest for future SOC integration. Since TSV fill material and s...
Jae-Seok Yang, Krit Athikulwongse, Young-Joon Lee,...
217
Voted
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 10 months ago
An extensible test framework for the Microsoft StreamInsight query processor
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications. StreamInsight adopts a deterministic stream model that leve...
Alex Raizman, Asvin Ananthanarayan, Anton Kirilov,...
203
Voted
DCOSS
2006
Springer
15 years 10 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
« Prev « First page 2171 / 2606 Last » Next »