Sciweavers

933 search results - page 88 / 187
» Monotone Complexity of a Pair
Sort
View
TSMC
2008
225views more  TSMC 2008»
13 years 8 months ago
Robust Methods for Geometric Primitive Recovery and Estimation From Range Images
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
Irina Lavva, Eyal Hameiri, Ilan Shimshoni
ATAL
2010
Springer
13 years 10 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
ISPDC
2010
IEEE
13 years 7 months ago
SKAIT: A Parameterized Key Assignment Scheme for Wireless Networks
—In this paper, we propose SKAIT, a parameterized symmetric key pre-distribution scheme that guarantees a secure and confidential channel between every pair of nodes in a wirele...
Ramon Novales, Neeraj Mittal, Kamil Saraç
JCC
2011
109views more  JCC 2011»
12 years 11 months ago
VoteDock: Consensus docking method for prediction of protein-ligand interactions
: Molecular recognition plays a fundamental role in all biological processes, and that is why great efforts have been made to understand and predict protein–ligand interactions. ...
Dariusz Plewczynski, Michal Lazniewski, Marcin von...
CP
2006
Springer
13 years 11 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer