Sciweavers

1257 search results - page 149 / 252
» A generalization of Euler's constant
Sort
View
HT
2005
ACM
16 years 1 days ago
What is the space for?: the role of space in authoring hypertext representations
This paper describes our approach of using spatial hypertext as a means separated from an end representation for hypertext authoring. By taking advantage of the power of rich inte...
Yasuhiro Yamamoto, Kumiyo Nakakoji, Yoshiyuki Nish...
PASTE
2005
ACM
16 years 1 days ago
Representation-independent program analysis
Program analysis has many applications in software engineering and high-performance computation, such as program understanding, debugging, testing, reverse engineering, and optimi...
Michelle Mills Strout, John M. Mellor-Crummey, Pau...
PODC
2005
ACM
16 years 1 days ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
TAPIA
2005
ACM
16 years 1 days ago
Computation of nonclassical shocks using a spacetime discontinuous Galerkin method
We present a numerical study for two systems of conservation laws using a spacetime discontinuous Galerkin (SDG) method with causal spacetime triangulations and the piecewise cons...
Katarina Jegdic
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
16 years 16 hour ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel