Sciweavers

3663 search results - page 636 / 733
» Problems in the ontology of computer programs
Sort
View
COMPGEOM
2003
ACM
15 years 3 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
DAC
1997
ACM
15 years 2 months ago
Static Timing Analysis of Embedded Software
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...
Sharad Malik, Margaret Martonosi, Yau-Tsun Steven ...
DCOSS
2006
Springer
15 years 1 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
TPDS
2008
196views more  TPDS 2008»
14 years 9 months ago
End-to-End Energy Management in Networked Real-Time Embedded Systems
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
G. Sudha Anil Kumar, Govindarasu Manimaran, Zhengd...