Sciweavers

2272 search results - page 179 / 455
» Capture Complexity by Partition
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 10 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
149
Voted
DEBS
2009
ACM
15 years 10 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
125
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
Four Group Decodable Differential Scaled Unitary Linear Space-Time Codes
— Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at ...
G. Susinder Rajan, B. Sundar Rajan
GRID
2007
Springer
15 years 9 months ago
Log summarization and anomaly detection for troubleshooting distributed systems
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...
Dan Gunter, Brian Tierney, Aaron Brown, D. Martin ...
123
Voted
IDA
2007
Springer
15 years 9 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka