Sciweavers

2206 search results - page 179 / 442
» On the power of coercion abstraction
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 6 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
IJES
2008
130views more  IJES 2008»
15 years 6 months ago
Deriving efficient control in Process Networks with Compaan/Laura
: At Leiden Embedded Research Center (LERC), we are building a tool chain called Compaan/Laura that allows us to map rapidly and efficiently signal processing applications written ...
Steven Derrien, Alexandru Turjan, Claudiu Zissules...
JNW
2006
131views more  JNW 2006»
15 years 6 months ago
Localized Recursive Estimation in Energy Constrained Wireless Sensor Networks
Abstract-- This paper proposes a localized recursive estimation scheme for parameter estimation in wireless sensor networks. Given any parameter of a target occurring at some locat...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan
FGCS
2007
129views more  FGCS 2007»
15 years 6 months ago
Analysis of business process integration in Web service context
The integration of Web services is a recent outgrowth of the Business Process integration field that will require powerful meta-schema mechanisms supported by higher level abstra...
Jun Shen, Georg Grossmann, Yun Yang, Markus Stumpt...