Sciweavers

20 search results - page 2 / 4
» Foundation Matters
Sort
View
JOC
2002
76views more  JOC 2002»
13 years 5 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
SIGSOFT
2006
ACM
14 years 6 months ago
User guidance for creating precise and accessible property specifications
Property specifications concisely describe aspects of what a system is supposed to do. No matter what notation is used to describe them, however, it is difficult to represent thes...
Rachel L. Cobleigh, George S. Avrunin, Lori A. Cla...
APWEB
2004
Springer
13 years 11 months ago
Semantic, Hierarchical, Online Clustering of Web Search Results
Today, search engine is the most commonly used tool for Web information retrieval, however, its current status is still far from satisfaction. This paper focuses on clustering Web...
Dell Zhang, Yisheng Dong
BIRTHDAY
2003
Springer
13 years 10 months ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
IJSM
2007
85views more  IJSM 2007»
13 years 5 months ago
Constraint Modeling for Curves and Surfaces in CAGD: a Survey
Computer-Aided Geometric Design modelers are now based on powerful mathematical curve and surface models, but there is still a considerable need for efficient tools to handle, ana...
Vincent Cheutet, Marc Daniel, Stefanie Hahmann, Ra...