11231 search results - page 253 / 2247 » Digging for Data Structures |
182
click to vote
CC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
140
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
140
click to vote
TVCG
2008
15 years 6 months ago
2008
Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with t...
164
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present a method for reconstructing 3D models of tree branch structure from laser range data. Our approach is probabilistic, and uses a generative model of a tree to guide a...
149
click to vote
ESOP
2004
Springer
15 years 12 months ago
2004
Springer
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...