Sciweavers

9 search results - page 1 / 2
» Finding Links and Initiators: A Graph-Reconstruction Problem...
Sort
View
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 1 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
CORR
2008
Springer
60views Education» more  CORR 2008»
13 years 4 months ago
Finding links and initiators: a graph reconstruction problem
Consider a 0
Heikki Mannila, Evimaria Terzi
BCSHCI
2007
13 years 6 months ago
Identifying web usability problems from eye-tracking data
Eye-tracking research is increasingly used to supplement usability tests in both commercial and academic practice. However, while there has been research into links between eyetra...
Claudia Ehmke, Stephanie Wilson
ETS
2000
IEEE
100views Hardware» more  ETS 2000»
13 years 4 months ago
Using computer-mediated communication to form a knowledge-building community with beginning teachers
This study investigated how different types of computer-mediated communication (CMC) such as asynchronous forums, synchronous forums and e-mail were used to support an alternative...
Brian Ferry, Julie Kiggins, Garry Hoban, Lori Lock...
NETWORKING
2008
13 years 6 months ago
The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
Siyu Tang, Huijuan Wang, Piet Van Mieghem