Sciweavers

19700 search results - page 3889 / 3940
» DNA-Based Computation Times
Sort
View
COMPGEOM
2008
ACM
13 years 10 months ago
Untangling triangulations through local explorations
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
Pankaj K. Agarwal, Bardia Sadri, Hai Yu
EUROSYS
2007
ACM
13 years 10 months ago
Enabling scalability and performance in a large scale CMP environment
Hardware trends suggest that large-scale CMP architectures, with tens to hundreds of processing cores on a single piece of silicon, are iminent within the next decade. While exist...
Bratin Saha, Ali-Reza Adl-Tabatabai, Anwar M. Ghul...
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 10 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
ECOWS
2008
Springer
13 years 10 months ago
Beyond Soundness: On the Semantic Consistency of Executable Process Models
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
Ingo Weber, Jörg Hoffmann, Jan Mendling
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
13 years 10 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
« Prev « First page 3889 / 3940 Last » Next »