Sciweavers

322 search results - page 36 / 65
» Structural and algorithmic aspects of massive social network...
Sort
View
AINA
2009
IEEE
15 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
79
Voted
STACS
2007
Springer
15 years 3 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
GD
2009
Springer
15 years 28 days ago
More Flexible Radial Layout
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
Ulrik Brandes, Christian Pich
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
14 years 11 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
101
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Automatic identification of speaker role and agreement/disagreement in broadcast conversation
We present supervised approaches for detecting speaker roles and agreement/disagreement between speakers in broadcast conversation shows in three languages: English, Arabic, and M...
Wen Wang, Sibel Yaman, Kristin Precoda, Colleen Ri...