Sciweavers

1529 search results - page 171 / 306
» A slant removal algorithm
Sort
View
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
14 years 10 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
SIGMOD
2005
ACM
97views Database» more  SIGMOD 2005»
14 years 10 months ago
Incognito: Efficient Full-Domain K-Anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and So...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
VMCAI
2010
Springer
14 years 7 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 4 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal