740 search results - page 142 / 148 » Lower bounds for Buchsbaum* complexes |
157
click to vote
SIGSOFT
2004
ACM
16 years 6 months ago
2004
ACM
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
187
click to vote
SIGSOFT
2003
ACM
16 years 6 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
179
click to vote
PODS
2008
ACM
16 years 5 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
153
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
149
click to vote
EUROSYS
2007
ACM
16 years 2 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...