Sciweavers

445 search results - page 34 / 89
» A Systematic Construction of Abstract Domains
Sort
View
ICC
2008
IEEE
120views Communications» more  ICC 2008»
14 years 3 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 2 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
EWC
2010
112views more  EWC 2010»
13 years 7 months ago
Meshing volumes with curved boundaries
Abstract This paper introduces a three-dimensional mesh generation algorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines ...
Steve Oudot, Laurent Rineau, Mariette Yvinec
JITE
2006
94views more  JITE 2006»
13 years 8 months ago
On the Design and Development of a UML-Based Visual Environment for Novice Programmers
learning abstract computer concepts. In addition, visualization helps novices construct a mental model of concepts, which is pivotal to further comprehension and understanding. Sec...
Brian D. Moor, Fadi P. Deek
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 3 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene