5019 search results - page 189 / 1004 » Computing in Quotient Groups |
177
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
143
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
On-line discovery of some auxiliary objects to verify the tracking results is a novel approach to achieving robust tracking by balancing the need for strong verification and compu...
204
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
159
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
180
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we study the modelling of consensus reaching in a ‘soft’ environment, i.e. when the individual testimonies are expressed as fuzzy preference relations. Here cons...