Sciweavers

2962 search results - page 73 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
ICSM
2009
IEEE
14 years 3 months ago
Augmenting static source views in IDEs with dynamic metrics
Mainstream IDEs such as Eclipse support developers in managing software projects mainly by offering static views of the source code. Such a static perspective neglects any informa...
David Röthlisberger, Marcel Harry, Alex Villa...
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
14 years 3 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 9 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 10 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
ICCV
2007
IEEE
14 years 3 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...