425 search results - page 26 / 85 » On the additive constant of the k-server Work Function Algor... |
AAAI
1996
13 years 9 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
We reconstruct geometry for a time-varying scene given by a number of video sequences. The dynamic geometry is represented by a 3D hypersurface embedded in space-time. The interse...
SC
2004
ACM
14 years 1 months ago
2004
ACM
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...
CODES
2005
IEEE
14 years 1 months ago
2005
IEEE
The continuous improvement on the design methodologies and processes has made possible the creation of huge and very complex digital systems. Design verification is one of the mai...