2654 search results - page 317 / 531 » On Pairing Inversion Problems |
134
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
162
click to vote
TCS
2010
15 years 3 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
157
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
137
click to vote
WWW
2010
ACM
16 years 2 days ago
2010
ACM
In an ideal world, interface design is the art and science of helping users accomplish tasks in a timely, efficient, and pleasurable manner. This paper studies the inverse situati...
155
click to vote
ASIACRYPT
2007
Springer
15 years 11 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...