Sciweavers

3791 search results - page 24 / 759
» Packing sets of patterns
Sort
View
FUIN
2006
160views more  FUIN 2006»
14 years 11 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
14 years 11 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong
SPAA
2010
ACM
15 years 3 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
15 years 11 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
FOCS
2006
IEEE
15 years 5 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt