6368 search results - page 279 / 1274 » Modeling Problem Transformations based on Data Complexity |
231
click to vote
VLDB
2005
ACM
16 years 20 days ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
228
click to vote
IPAW
2010
15 years 4 months ago
2010
Abstract. "Why does the build fail currently?" - This and similar questions arise on a daily basis in software development processes (SDP). There is no easy way to answer...
190
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
219
click to vote
ECCV
1992
Springer
15 years 11 months ago
1992
Springer
A key problem in model-based object recognition is selection, namely, the problem of determining which regions in the image are likely to come from a single object. In this paper w...
197
click to vote
SMA
2005
ACM
16 years 22 days ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...