5592 search results - page 192 / 1119 » On Random Betweenness Constraints |
262
Voted
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
155
click to vote
EWSN
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. We propose a lightweight localisation approach for supporting distance and range queries in ad hoc wireless sensor networks. In contrast to most previous localisation app...
131
click to vote
CPAIOR
2007
Springer
16 years 7 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
160
click to vote
VMCAI
2007
Springer
16 years 5 days ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
162
click to vote
3DPVT
2006
IEEE
16 years 4 days ago
2006
IEEE
We present a new algorithm for improving an available (conservative) estimate of the shape of an object using constraints from ray-tracing. In particular, we exploit incoherences ...