Sciweavers

4037 search results - page 421 / 808
» Routing without ordering
Sort
View
119
Voted
IPL
2008
118views more  IPL 2008»
15 years 3 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
128
Voted
IJES
2006
72views more  IJES 2006»
15 years 3 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
IJNSEC
2006
69views more  IJNSEC 2006»
15 years 3 months ago
Active Trial-and-error Attack on SASC Protocols
SASC (Server-Aided Secret Computation) protocols enable a client (a smart card) to borrow computing power from a server (e.g., an untrustworthy auxiliary device like an ATM) witho...
Heeyoul Kim, Younho Lee, Seong-Min Hong, Hyunsoo Y...
CORR
2007
Springer
103views Education» more  CORR 2007»
15 years 3 months ago
Interactive Small-Step Algorithms I: Axiomatization
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...
161
Voted
CPHYSICS
2007
96views more  CPHYSICS 2007»
15 years 3 months ago
Simple models for biomembrane structure and dynamics
Simulation of biomembranes over length and time scales relevant to cellular biology is not currently feasible with molecular dynamics including full atomic detail. Barring an unfo...
Frank L. H. Brown