Sciweavers

4536 search results - page 348 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
AI
2003
Springer
16 years 23 hour ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 7 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
152
Voted
VMCAI
2009
Springer
16 years 1 months ago
Deciding Extensions of the Theories of Vectors and Bags
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...
Patrick Maier
ICTAC
2005
Springer
16 years 9 days 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
GISCIENCE
2004
Springer
112views GIS» more  GISCIENCE 2004»
16 years 5 days ago
Project Lachesis: Parsing and Modeling Location Histories
Abstract. A datatype with increasing importance in GIS is what we call the location history–a record of an entity’s location in geographical space over an interval of time. Thi...
Ramaswamy Hariharan, Kentaro Toyama