Sciweavers

1327 search results - page 124 / 266
» Data Dependent Circuit Design: A Case Study
Sort
View
AEI
2008
108views more  AEI 2008»
15 years 6 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
SAC
2004
ACM
15 years 11 months ago
Information requirements engineering for data warehouse systems
Information requirements analysis for data warehouse systems differs significantly from requirements analysis for conventional information systems. Based on interviews with projec...
Robert Winter, Bernhard Strauch
OOPSLA
2005
Springer
15 years 12 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
VLDB
2005
ACM
125views Database» more  VLDB 2005»
16 years 6 months ago
Sync your data: update propagation for heterogeneous protein databases
The traditional model of bench (wet) chemistry in many life sciences domain is today actively complimented by computer-based discoveries utilizing the growing number of online data...
Kajal T. Claypool, Elke A. Rundensteiner
INFOCOM
2009
IEEE
16 years 1 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec