Sciweavers

3690 search results - page 486 / 738
» Computation with classical sequents
Sort
View
BIRTHDAY
2006
Springer
15 years 10 months ago
Reductio ad Absurdum: Planning Proofs by Contradiction
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
Erica Melis, Martin Pollet, Jörg H. Siekmann
181
Voted
CCS
2006
ACM
15 years 10 months ago
Time series modeling for IDS alert management
Intrusion detection systems create large amounts of alerts. Significant part of these alerts can be seen as background noise of an operational information system, and its quantity...
Jouni Viinikka, Hervé Debar, Ludovic M&eacu...
181
Voted
EUSAI
2004
Springer
15 years 10 months ago
Distance-Based Access Modifiers Applied to Safety in Home Networks
Home networks and the interconnection of home appliances is a classical theme in ubiquitous computing research. Security is a recurring concern, but there is a lack of awareness of...
Kjeld Høyer Mortensen, Kari R. Schougaard, ...
ENC
2006
IEEE
15 years 10 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...
ESA
2006
Springer
102views Algorithms» more  ESA 2006»
15 years 10 months ago
Necklaces, Convolutions, and X + Y
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...