15033 search results - page 218 / 3007 » Complexity Theory and Algorithms |
127
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
104
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
108
click to vote
JDA
2006
15 years 4 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
125
click to vote
HICSS
2009
IEEE
15 years 11 months ago
2009
IEEE
Research has identified the potential and challenges of information sharing in government settings mostly within the context of a single country. The challenges facing inter-gover...
168
click to vote
RTA
2005
Springer
15 years 10 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...