Sciweavers

2200 search results - page 65 / 440
» Bloch's Constant is Computable
Sort
View
ICCS
2005
Springer
15 years 3 months ago
Computational Complexity and Distributed Execution in Water Quality Management
Abstract. Modeling is considered an inherent part of design, operation and optimization of Water Quality Systems. Models are used for running so-called Virtual Experiments, such as...
Maria Chtepen, Filip H. A. Claeys, Bart Dhoedt, Pe...
IFIP
2004
Springer
15 years 3 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
ISWC
2002
IEEE
15 years 2 months ago
A Menu Interface for Wearable Computing
We present a menu interface designed primarily for headworn displays that have a small field-of-view. To support interaction with a hierarchical menu, we logically divide an absol...
Gábor Blaskó, Steven Feiner
ICS
2010
Tsinghua U.
15 years 2 months ago
Cache oblivious parallelograms in iterative stencil computations
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak, Ha...
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 2 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert