Sciweavers

1226 search results - page 177 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 3 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
JUCS
2006
107views more  JUCS 2006»
15 years 3 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
JPDC
2010
117views more  JPDC 2010»
15 years 1 months ago
Extensible transactional memory testbed
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...
COMPSYSTECH
2011
14 years 3 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos
ICSE
2007
IEEE-ACM
16 years 3 months ago
Reconceptualizing a Family of Heterogeneous Embedded Systems via Explicit Architectural Support
It has been widely advocated that software architecture an effective set of abstractions for engineering (families of) complex software systems. However, architectural concepts ar...
Sam Malek, Chiyoung Seo, Sharmila Ravula, Brad Pet...