Sciweavers

1028 search results - page 117 / 206
» Measuring Distributional Similarity in Context
Sort
View
ISCIS
2005
Springer
14 years 2 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
MOBICOM
2004
ACM
14 years 2 months ago
Characterizing flows in large wireless data networks
Several studies have recently been performed on wireless university campus networks, corporate and public networks. Yet little is known about the flow-level characterization in s...
Xiaoqiao Meng, Starsky H. Y. Wong, Yuan Yuan, Song...
CIA
2004
Springer
14 years 2 months ago
Qualitative Analysis of User-Based and Item-Based Prediction Algorithms for Recommendation Agents
Recommendation agents employ prediction algorithms to provide users with items that match their interests. In this paper, several prediction algorithms are described and evaluated...
Manos Papagelis, Dimitris Plexousakis
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
14 years 1 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
CIKM
2008
Springer
13 years 10 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...