967 search results - page 17 / 194 » Building a Calculus of Data Structures |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
ENTCS
2000
13 years 7 months ago
2000
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
JVCA
2002
13 years 7 months ago
2002
We propose a new service for building user-defined 3D anatomic structures on the Web. The Web server is connected to a data base storing more than 1000 3D anatomic models reconstr...
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
A framework is presented for estimating the pose of a camera based on images extracted from a single omnidirectional image of an urban scene, given a 2D map with building outlines...