Sciweavers

1986 search results - page 160 / 398
» Path Separability of Graphs
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 7 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
ICSE
2003
IEEE-ACM
14 years 10 months ago
Pluggable Reflection: Decoupling Meta-Interface and Implementation
Reflection remains a second-class citizen in current programming models, where it's assumed to be imperative and tightly bound to its implementation. In contrast, most object...
David H. Lorenz, John M. Vlissides
AMDO
2008
Springer
14 years 3 days ago
Mesh Vertex Pose and Position Interpolation Using Geometric Algebra
This paper presents a method of interpolating between two or more general displacements (rotation and translation). The resulting interpolated path is smooth and possesses a number...
Rich Wareham, Joan Lasenby
CIKM
2011
Springer
12 years 10 months ago
Estimating selectivity for joined RDF triple patterns
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
Hai Huang 0003, Chengfei Liu
ICDE
2005
IEEE
134views Database» more  ICDE 2005»
14 years 3 months ago
Index Structures for Matching XML Twigs Using Relational Query Processors
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Kou...