Sciweavers

694 search results - page 128 / 139
» Open Graphs and Computational Reasoning
Sort
View
CHI
2004
ACM
14 years 9 months ago
Common sense investing: bridging the gap between expert and novice
In this paper, we describe Common Sense Investing (CSI), an interactive investment tool that uses a knowledge base of common sense statements in conjunction with domain knowledge ...
Ashwani Kumar, Sharad C. Sundararajan, Henry Liebe...
SPAA
2009
ACM
14 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
ASIACRYPT
2007
Springer
14 years 3 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
EMSOFT
2007
Springer
14 years 3 months ago
Proving the absence of run-time errors in safety-critical avionics code
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
Patrick Cousot
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 2 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...