Sciweavers

85 search results - page 17 / 17
» New Streaming Algorithms for Counting Triangles in Graphs
Sort
View
KAIS
2010
139views more  KAIS 2010»
13 years 3 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
13 years 11 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
KDD
2005
ACM
151views Data Mining» more  KDD 2005»
14 years 5 months ago
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Temporal Text Mining (TTM) is concerned with discovering temporal patterns in text information collected over time. Since most text information bears some time stamps, TTM has man...
Qiaozhu Mei, ChengXiang Zhai
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 8 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
ICWE
2004
Springer
13 years 10 months ago
Automatic Interpretation of Natural Language for a Multimedia E-learning Tool
Abstract. This paper describes the new e-learning tool CHESt that allows students to search in a knowledge base for short (teaching) multimedia clips by using a semantic search eng...
Serge Linckels, Christoph Meinel