Sciweavers

4218 search results - page 61 / 844
» Complete sets of cooperations
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
MAGS
2006
79views more  MAGS 2006»
13 years 7 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...
CSCW
2002
ACM
13 years 7 months ago
Who can claim complete abstinence from peeking at print jobs?
While systems supporting communities of practice in work organizations have been shown to be desirable many, if not all, are decoupled from daily work practices and tools. This hi...
Antonietta Grasso, Jean-Luc Meunier
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
13 years 11 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
TSP
2010
13 years 2 months ago
Improving wireless physical layer security via cooperating relays
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel c...
Lun Dong, Zhu Han, Athina P. Petropulu, H. Vincent...