Sciweavers

419 search results - page 78 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
SEFM
2007
IEEE
14 years 1 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
FC
2005
Springer
83views Cryptology» more  FC 2005»
14 years 1 months ago
Secure Distributed Human Computation
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebi...
COLT
1999
Springer
13 years 12 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
ISSTA
2010
ACM
13 years 11 months ago
Learning from 6, 000 projects: lightweight cross-project anomaly detection
Real production code contains lots of knowledge—on the domain, on the architecture, and on the environment. How can we leverage this knowledge in new projects? Using a novel lig...
Natalie Gruska, Andrzej Wasylkowski, Andreas Zelle...
VIP
2000
13 years 9 months ago
Graphically Defining Articulable Tacit Knowledge
Although codified knowledge and its capture is commonplace, tacit knowledge has up until recent years proved elusive in its inclusion within the organisation's knowledge base...
Peter Busch, Debbie Richards