Sciweavers

1938 search results - page 332 / 388
» Dependable Software
Sort
View
ICFP
2012
ACM
13 years 8 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 6 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
POPL
2008
ACM
16 years 6 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
SEMWEB
2009
Springer
16 years 20 days ago
Populating the Semantic Web by Macro-reading Internet Text
A key question regarding the future of the semantic web is “how will we acquire structured information to populate the semantic web on a vast scale?” One approach is to enter t...
Tom M. Mitchell, Justin Betteridge, Andrew Carlson...
SIGCOMM
2009
ACM
16 years 20 days ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy