11214 search results - page 2057 / 2243 » Just-in-time data structures |
101
click to vote
DM
2006
14 years 11 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
ECEASST
2006
14 years 11 months ago
2006
Abstract. The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. Within model driven softw...
IJAR
2008
14 years 11 months ago
2008
There is a well-recognised need in diverse applications for reasoning with multiple, potentially inconsistent sources of information. One approach is to represent each source of i...
119
click to vote
IJCV
2008
14 years 11 months ago
2008
This work achieves an efficient acquisition of scenes and their depths along long streets. A camera is mounted on a vehicle moving along a straight or a mildly curved path and a sa...
FMSD
2006
14 years 11 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...