Sciweavers

882 search results - page 140 / 177
» On the Hardness of Graph Isomorphism
Sort
View
CTRSA
2007
Springer
112views Cryptology» more  CTRSA 2007»
14 years 2 months ago
Directed Transitive Signature Scheme
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
Xun Yi
PODC
2004
ACM
14 years 2 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen
AMAI
2004
Springer
14 years 2 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 2 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
MSWIM
2003
ACM
14 years 1 months ago
Simulation of large ad hoc networks
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...
Valeriy Naoumov, Thomas R. Gross