Sciweavers

1211 search results - page 8 / 243
» Computing Manipulations of Ranking Systems
Sort
View
COLCOM
2007
IEEE
14 years 1 months ago
Countering feedback sparsity and manipulation in reputation systems
—Reputation systems provide a promising way for building trust through social control in collaborative communities by harnessing the community knowledge in the form of feedback. ...
Li Xiong, Ling Liu, Mustaque Ahamad
HAPTICS
2008
IEEE
14 years 2 months ago
Haptic Feedback Based on Physically Based Modeling for Cellular Manipulation Systems
This paper focuses on developing a haptic rendering technique for cellular manipulation using image processing techniques and physically based models. The interaction forces betwee...
Jungsik Kim, Farrokh Janabi-Sharifi, Jung Kim
AAAI
2012
11 years 10 months ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer
HPCN
1997
Springer
13 years 11 months ago
Boolean Function Manipulation on a Parallel System Using BDDs
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
F. Bianchi, Fulvio Corno, Maurizio Rebaudengo, Mat...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang