Sciweavers

1027 search results - page 50 / 206
» Ordered Vertex Partitioning
Sort
View
JDM
1998
101views more  JDM 1998»
13 years 9 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
ICML
2006
IEEE
14 years 10 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ICMCS
2006
IEEE
149views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Semantic 3D Face Mesh Simplification for Transmission and Visualization
Three-dimensional data generated from range scanners is usually composed of a huge amount of information. Simplification and compression techniques must be adopted in order to red...
Alessandro Colombo, Claudio Cusano, Raimondo Schet...
PODS
1993
ACM
161views Database» more  PODS 1993»
14 years 1 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
14 years 1 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu