15073 search results - page 2585 / 3015 » Probabilistic algorithms for computing resultants |
148
click to vote
ACISP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
151
click to vote
SIGGRAPH
1993
ACM
15 years 9 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
136
click to vote
GROUP
2007
ACM
15 years 9 months ago
2007
ACM
Being aware of others' activities has played a vital role in the success of online collaboration. This resulted in the emergence of many groupware systems that provide users ...
172
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
151
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...