Sciweavers

648 search results - page 63 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
PG
2002
IEEE
14 years 21 days ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...
COCOON
2001
Springer
14 years 9 days ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
OL
2011
242views Neural Networks» more  OL 2011»
13 years 2 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
WWW
2008
ACM
14 years 8 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
ICAS
2005
IEEE
95views Robotics» more  ICAS 2005»
14 years 1 months ago
Improving APS with Anchor Selection in Anisotropic Sensor Networks
Sensor networks are useful for environmental monitoring, military applications, disaster management, etc. In many applications, sensors are supposed to know their geographic locat...
King-Yip Cheng, Vincent Tam, King-Shan Lui