Sciweavers

1722 search results - page 207 / 345
» On the sample mean of graphs
Sort
View
PCM
2005
Springer
119views Multimedia» more  PCM 2005»
16 years 21 hour ago
Haptic Interaction with Depth Video Media
Abstract. In this paper we propose a touch enabled video player system. A conventional video player only allows viewers to passively experience visual and audio media. In virtual e...
Jongeun Cha, Seung Man Kim, Ian Oakley, Jeha Ryu, ...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 10 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
UAI
2008
15 years 8 months ago
Discovering Cyclic Causal Models by Independent Components Analysis
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 6 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
INFOCOM
2011
IEEE
14 years 10 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...