Sciweavers

48 search results - page 3 / 10
» The complexity of central series in nilpotent computable gro...
Sort
View
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
13 years 9 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
ICDM
2010
IEEE
273views Data Mining» more  ICDM 2010»
13 years 3 months ago
Learning Maximum Lag for Grouped Graphical Granger Models
Temporal causal modeling has been a highly active research area in the last few decades. Temporal or time series data arises in a wide array of application domains ranging from med...
Amit Dhurandhar
ACL
2010
13 years 3 months ago
Finding Cognate Groups Using Phylogenies
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
David Hall, Dan Klein
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 2 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
IV
2005
IEEE
178views Visualization» more  IV 2005»
13 years 11 months ago
Capturing Team Dynamics through Temporal Social Surfaces
This paper introduces Temporal Social Surfaces. Temporal Social Surfaces show the dynamic evolution of social relationships in groups. Changes in measures of social network analys...
Peter A. Gloor