Sciweavers

2774 search results - page 211 / 555
» Exploiting Deep Structure
Sort
View
KR
2000
Springer
15 years 10 months ago
Satisfiability Algorithms and Finite Quantification
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
Matthew L. Ginsberg, Andrew J. Parkes
RT
2000
Springer
15 years 10 months ago
Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
Luc Leblanc, Pierre Poulin
ICCAD
1995
IEEE
77views Hardware» more  ICCAD 1995»
15 years 10 months ago
PARAS: system-level concurrent partitioning and scheduling
Partitioning for the ASIC designs is examined and the interaction between high-level synthesis and partitioning is studied and incorporated in the solution. Four algorithms (calle...
Wing Hang Wong, Rajiv Jain
BTW
2009
Springer
117views Database» more  BTW 2009»
15 years 10 months ago
Bringing BLINK Closer to the Full Power of SQL
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...
Knut Stolze, Vijayshankar Raman, Richard Sidle, O....
BTW
2009
Springer
90views Database» more  BTW 2009»
15 years 10 months ago
Streaming Web Services and Standing Processes
: Today, service orientation is a well established concept in modern IT infrastructures. Web services and WS-BPEL as the two key technologies handle large structured data sets very...
Steffen Preissler, Hannes Voigt, Dirk Habich, Wolf...