Sciweavers

2585 search results - page 224 / 517
» computing 1999
Sort
View
IPL
2002
60views more  IPL 2002»
15 years 3 months ago
s-partitions
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...
William M. Y. Goh, Pawel Hitczenko, Ali Shokoufand...
CACM
1999
49views more  CACM 1999»
15 years 3 months ago
OO Distributed Programming is Not Distributed OO Programming
centralized abstractions. The metaphor of a community of independent objects communicating by passing messages is misleading and dangerous when thinking in terms of a distributed s...
Rachid Guerraoui, Mohamed Fayad
CN
1999
88views more  CN 1999»
15 years 3 months ago
Building a high-performance, programmable secure coprocessor
Secure coprocessors enable secure distributed applications by providing safe havens where an application program can Z .execute and accumulate state , free of observation and inte...
Sean W. Smith, Steve Weingart
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 3 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 3 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden