Sciweavers

13784 search results - page 351 / 2757
» On Computing Functions with Uncertainty
Sort
View
JPDC
2006
83views more  JPDC 2006»
15 years 6 months ago
Virtual Leashing: Creating a computational foundation for software protection
We introduce Virtual Leashing,1 a new technique for software protection and control. The leashing process removes small fragments of code, pervasive throughout the application, an...
Ori Dvir, Maurice Herlihy, Nir Shavit

Publication
202views
17 years 3 months ago
Distance-based Speed Functions for Level Set Methods in Image Segmentation
"Level set methods are a well-known means for the segmentation of objects in image data. In this paper, we discuss a class of easy to calculate terms based on distance measure...
Karsten Rink and Klaus Tonnies
DAC
1999
ACM
16 years 7 months ago
Representation of Function Variants for Embedded System Optimization and Synthesis
Many embedded systems are implemented with a set of alternative function variants to adapt the system to different applications or environments. This paper proposes a novel approa...
Dirk Ziegenbein, Jürgen Teich, Kai Richter, L...
179
Voted
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
16 years 1 months ago
One-Way Functions and the Berman-Hartmanis Conjecture
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
Manindra Agrawal, Osamu Watanabe
CISIS
2008
IEEE
16 years 1 months ago
Inferring the Function of Genes from Synthetic Lethal Mutations
—Techniques for detecting synthetic lethal mutations in double gene deletion experiments are emerging as powerful tool for analysing genes in parallel or overlapping pathways wit...
Oliver Ray, Christopher H. Bryant