Sciweavers

632 search results - page 104 / 127
» Proving Invariants of Functional Programs
Sort
View
ISCAPDCS
2004
15 years 1 months ago
An Open Digest-based Technique for Spam Detection
A promising anti-spam technique consists in collecting users opinions that given email messages are spam and using this collective judgment to block message propagation to other u...
Ernesto Damiani, Sabrina De Capitani di Vimercati,...
88
Voted
PDPTA
2004
15 years 1 months ago
Evaluation of a Job Admission Algorithm for Bandwidth Constrained Grids
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
111
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 15 days ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
109
Voted
JDA
2006
85views more  JDA 2006»
15 years 12 days ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
80
Voted
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 9 days ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara