Sciweavers

1552 search results - page 194 / 311
» On the Complexity of Constant Propagation
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 6 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
DCG
2008
93views more  DCG 2008»
15 years 6 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
JAL
2008
74views more  JAL 2008»
15 years 6 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
GRID
2007
Springer
15 years 6 months ago
A Tool for Prioritizing DAGMan Jobs and its Evaluation
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenb...
JCP
2007
181views more  JCP 2007»
15 years 6 months ago
Reducing Energy Consumption of Wireless Sensor Networks through Processor Optimizations
When the environmental conditions are stable, a typical Wireless Sensor Network (WSN) application may sense and process very similar or constant data values for long durations. Thi...
Gürhan Küçük, Can Basaran