3405 search results - page 547 / 681 » Factoring Groups Efficiently |
204
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
174
click to vote
COMPSEC
2008
15 years 6 months ago
2008
While general-purpose processor based systems are built to enforce memory protection to prevent the unintended sharing of data between processes, current systems built around reco...
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
With the increasing growth of technology and the entrance into the digital age, we have to handle a vast amount of information every time which often presents difficulties. So, the...