1916 search results - page 61 / 384 » Reasoning with class algebra |
STOC
2009
ACM
14 years 10 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
ECSQARU
2003
Springer
14 years 3 months ago
2003
Springer
An overview is provided of recent developments in the use of latent class (LC) models in social science research. Special attention is paid to the application of LC analysis as a f...
ICSE
2004
IEEE-ACM
14 years 10 months ago
2004
IEEE-ACM
Despite their benefits, programmers rarely use formal specifications, because they are difficult to write and they require an up front investment in time. To address these issues,...
DIMACS
2001
13 years 11 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...