Sciweavers

6274 search results - page 816 / 1255
» Proofs, Programs, Processes
Sort
View
FOSSACS
2005
Springer
16 years 11 days ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
170
Voted
PATAT
2004
Springer
130views Education» more  PATAT 2004»
16 years 5 days ago
Learning User Preferences in Distributed Calendar Scheduling
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
Jean Oh, Stephen F. Smith
COMPGEOM
2003
ACM
16 years 2 days ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
SAC
2009
ACM
15 years 11 months ago
Taking total control of voting systems: firmware manipulations on an optical scan voting terminal
The firmware of an electronic voting machine is typically treated as a “trusted” component of the system. Consequently, it is misconstrued to be vulnerable only to an insider...
Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, La...
FOCS
1999
IEEE
15 years 11 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan