Sciweavers

2983 search results - page 260 / 597
» The group marriage problem
Sort
View
WWW
2008
ACM
16 years 7 months ago
Finding core members in virtual communities
Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizi...
Haiqiang Chen, Xueqi Cheng, Yue Liu
CHI
2010
ACM
16 years 1 months ago
How power users help and hinder open bug reporting
Many power users that contribute to open source projects have no intention of becoming regular contributors; they just want a bug fixed or a feature implemented. How often do thes...
Andrew J. Ko, Parmit K. Chilana
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
16 years 1 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
ICASSP
2009
IEEE
16 years 1 months ago
L1 regularized super-resolution from unregistered omnidirectional images
In this paper, we address the problem of super-resolution from multiple low-resolution omnidirectional images with inexact registration. Such a problem is typically encountered in...
Zafer Arican, Pascal Frossard
INFOCOM
2008
IEEE
16 years 1 months ago
Light-Weight Contour Tracking in Wireless Sensor Networks
Abstract—We study the problem of contour tracking with binary sensors, an important problem for monitoring spatial signals and tracking group targets. In particular, we track the...
Xianjin Zhu, Rik Sarkar, Jie Gao, Joseph S. B. Mit...