444 search results - page 80 / 89 » Selectional Restrictions in HPS |
182
click to vote
ASIACRYPT
2007
Springer
16 years 7 days 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 ...
175
click to vote
CIKM
2007
Springer
16 years 6 days ago
2007
Springer
Traditional adaptive filtering systems learn the user’s interests in a rather simple way – words from relevant documents are favored in the query model, while words from irre...
170
click to vote
MM
2006
ACM
16 years 5 hour ago
2006
ACM
It is well-known that live multimedia streaming applications operate more efficiently when organized in peer-to-peer (P2P) topologies, since peer upload capacities are utilized t...
162
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present a latent hierarchical structural learning method for object detection. An object is represented by a mixture of hierarchical tree models where the nodes represent objec...
161
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...