Sciweavers

362 search results - page 71 / 73
» Formal Theories for Linear Algebra
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 7 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
ICFP
2005
ACM
14 years 7 months ago
A step-indexed model of substructural state
The concept of a "unique" object arises in many emerging programming languages such as Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects ma...
Amal J. Ahmed, Matthew Fluet, Greg Morrisett
ICFP
2004
ACM
14 years 7 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
BROADNETS
2005
IEEE
14 years 1 months ago
Dual-link failure resiliency through backup link mutual exclusion
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Amit Chandak, Srinivasan Ramasubramanian