457 search results - page 71 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
202
click to vote
GRAPHICSINTERFACE
2007
15 years 7 months ago
2007
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
189
click to vote
WAW
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
169
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
142
Voted
MFCS
2009
Springer
16 years 19 days ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
129
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...