Sciweavers

252 search results - page 11 / 51
» Automata for Data Words and Data Trees
Sort
View
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 7 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
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
14 years 10 days ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
ICTAC
2005
Springer
14 years 1 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
13 years 7 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang