Sciweavers

2035 search results - page 241 / 407
» Working memory
Sort
View
ADHOC
2006
184views more  ADHOC 2006»
15 years 4 months ago
Wireless underground sensor networks: Research challenges
This work introduces the concept of a Wireless Underground Sensor Network (WUSN). WUSNs can be used to monitor a variety of conditions, such as soil properties for agricultural ap...
Ian F. Akyildiz, Erich P. Stuntebeck
CGF
2006
136views more  CGF 2006»
15 years 4 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
PC
2006
124views Management» more  PC 2006»
15 years 4 months ago
Message-passing code generation for non-rectangular tiling transformations
Tiling is a well known loop transformation used to reduce communication overhead in distributed memory machines. Although a lot of theoretical research has been done concerning th...
Georgios I. Goumas, Nikolaos Drosinos, Maria Athan...
TCAD
2008
116views more  TCAD 2008»
15 years 4 months ago
Scalable Synthesis and Clustering Techniques Using Decision Diagrams
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown