Sciweavers

281 search results - page 55 / 57
» The Complexity of Planar Counting Problems
Sort
View
WWW
2011
ACM
13 years 2 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
SOCIALCOM
2010
13 years 2 months ago
Learning Influence Propagation of Personal Blogs with Content and Network Analyses
Weblogs (blogs) serve as a gateway to a large blog reader population, so blog authors can potentially influence a large reader population by expressing their thoughts and expertise...
Il-Chul Moon, Dongwoo Kim, Yohan Jo, Alice H. Oh
CVPR
2007
IEEE
14 years 9 months ago
Integration of Motion Cues in Optical and Sonar Videos for 3-D Positioning
Target-based positioning and 3-D target reconstruction are critical capabilities in deploying submersible platforms for a range of underwater applications, e.g., search and inspec...
Shahriar Negahdaripour, Hamed Pirsiavash, Hicham S...
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 8 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon