2489 search results - page 78 / 498 » On the Subgroup Distance Problem |
152
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
134
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
128
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
179
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...