1295 search results - page 42 / 259 » Palimpsests of Time and Place |
GD
2003
Springer
15 years 5 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
120
click to vote
PG
2002
IEEE
15 years 4 months ago
2002
IEEE
We present a novel use of commodity graphics hardware that effectively combines a plane-sweeping algorithm with view synthesis for real-time, on-line 3D scene acquisition and view...
PKC
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
JSW
2008
14 years 11 months ago
2008
Precise analysis of the Web structure can facilitate data pre-processing and enhance the accuracy of the mining results in the procedure of Web usage mining. STPN Stochastic Timed...
108
click to vote
ICIAP
2009
ACM
16 years 13 days ago
2009
ACM
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...