1291 search results - page 124 / 259 » Computing the multiplicity structure in solving polynomial s... |
113
click to vote
CHES
2000
Springer
15 years 6 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
154
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
111
click to vote
ICCSA
2007
Springer
15 years 5 months ago
2007
Springer
Coupled systems comprise multiple interacting subsystems and are an increasingly common computational science application, most notably as multiscale and multiphysics models. Paral...
112
click to vote
AAAI
2006
15 years 3 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
149
click to vote
FCCM
2008
IEEE
15 years 8 months ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...