Sciweavers

4926 search results - page 650 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
DCOSS
2008
Springer
13 years 10 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
LCTRTS
2009
Springer
14 years 3 months ago
Synergistic execution of stream programs on multicores with accelerators
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
SIGIR
2010
ACM
14 years 11 days ago
Freshness matters: in flowers, food, and web authority
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...
Na Dai, Brian D. Davison
VISSYM
2004
13 years 9 months ago
Occlusion Culling for Sub-Surface Models in Geo-Scientific Applications
We present a three pass occlusion culling algorithm, which makes efficient use of hardware support. Our geo-scientific sub-surface data sets consist typically of a set of high res...
John Plate, Anselm Grundhöfer, Benjamin Schmi...
SRDS
2006
IEEE
14 years 2 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring