Sciweavers

325 search results - page 2 / 65
» Alternatives to two classic data structures
Sort
View
WEBDB
2010
Springer
152views Database» more  WEBDB 2010»
13 years 11 months ago
Reconciling two models of multihierarchical markup
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
Neil Moore
ICCSA
2007
Springer
14 years 12 days ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
BMCBI
2010
125views more  BMCBI 2010»
13 years 6 months ago
NeatMap - non-clustering heat map alternatives in R
Background: The clustered heat map is the most popular means of visualizing genomic data. It compactly displays a large amount of data in an intuitive format that facilitates the ...
Satwik Rajaram, Yoshi Oono
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 6 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
DATAMINE
2008
137views more  DATAMINE 2008»
13 years 6 months ago
Two heads better than one: pattern discovery in time-evolving multi-aspect data
Abstract. Data stream values are often associated with multiple aspects. For example, each value observed at a given time-stamp from environmental sensors may have an associated ty...
Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke,...