Sciweavers

7430 search results - page 1354 / 1486
» Programming Applications in CIFF
Sort
View
COCOA
2008
Springer
15 years 5 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
118
Voted
CSR
2008
Springer
15 years 5 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
144
Voted
DAC
2008
ACM
15 years 5 months ago
Protecting bus-based hardware IP by secret sharing
Our work addresses protection of hardware IP at the mask level with the goal of preventing unauthorized manufacturing. The proposed protocol based on chip locking and activation i...
Jarrod A. Roy, Farinaz Koushanfar, Igor L. Markov
138
Voted
DCOSS
2008
Springer
15 years 5 months ago
Decoding Code on a Sensor Node
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
Pascal von Rickenbach, Roger Wattenhofer
137
Voted
DCOSS
2008
Springer
15 years 5 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
« Prev « First page 1354 / 1486 Last » Next »