35 search results - page 2 / 7 » Canonical Data Structure for Interval Probe Graphs |
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
BMCBI
2008
13 years 5 months ago
2008
Background: MLPA method is a potentially useful semi-quantitative method to detect copy number alterations in targeted regions. In this paper, we propose a method for the normaliz...
SENSYS
2005
ACM
13 years 10 months ago
2005
ACM
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
LCTRTS
2007
Springer
13 years 11 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...