Sciweavers

2124 search results - page 257 / 425
» Repairing Structurally Complex Data
Sort
View
AISS
2010
146views more  AISS 2010»
14 years 9 months ago
Zatara, the Plug-in-able Eventually Consistent Distributed Database
With the proliferation of the computer Cloud, new software delivery methods were created. In order to build software to fit into one of these models, a scalable, easy to deploy st...
Bogdan Carstoiu, Dorin Carstoiu
113
Voted
ICPR
2002
IEEE
16 years 3 months ago
Perceptual Grouping for Multiple View Stereo Using Tensor Voting
* We address the problem of multiple view stereo from a perceptual organization perspective. Currently, the leading methods in the field are volumetric. They operate at the level o...
Gérard G. Medioni, Philippos Mordohai
154
Voted
I3D
2010
ACM
15 years 11 months ago
Efficient Sparse Voxel Octrees
In this paper we examine the possibilities of using voxel representations as a generic way for expressing complex and feature-rich geometry on current and future GPUs. We present ...
Samuli Laine, Tero Karras
CSR
2007
Springer
15 years 8 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
LFCS
2007
Springer
15 years 8 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang