1066 search results - page 68 / 214 » Computing Private Set Operations with Linear Complexities |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
102
click to vote
COORDINATION
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents Limone, a new coordination model that facilitates rapid application development over ad hoc networks consisting of logically mobile agents and physically mobile...
WSC
2004
14 years 11 months ago
2004
The authors present the requirement definition and methodological approach for developing a new generation of Computer Generated Forces (CGF) based on Intelligent Agents. The anal...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...