Sciweavers

1392 search results - page 238 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 2 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
CC
2001
Springer
131views System Software» more  CC 2001»
15 years 2 months ago
Compiler Transformation of Pointers to Explicit Array Accesses in DSP Applications
Abstract. Efficient implementation of DSP applications are critical for embedded systems. However, current applications written in C, make extensive use of pointer arithmetic maki...
Björn Franke, Michael F. P. O'Boyle
CONCUR
2006
Springer
15 years 1 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
BMCBI
2008
154views more  BMCBI 2008»
14 years 9 months ago
GenomeMatcher: A graphical user interface for DNA sequence comparison
Background: The number of available genome sequences is increasing, and easy-to-use software that enables efficient comparative analysis is needed. Results: We developed GenomeMat...
Yoshiyuki Ohtsubo, Wakako Ikeda-Ohtsubo, Yuji Naga...
105
Voted
COMCOM
2011
14 years 4 months ago
Reconstructing social interactions using an unreliable wireless sensor network
In the very active field of complex networks, research advances have largely been stimulated by the availability of empirical data and the increase in computational power needed ...
Adrien Friggeri, Guillaume Chelius, Eric Fleury, A...