Sciweavers

1760 search results - page 91 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
NETWORKS
2006
13 years 8 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
CIKM
2009
Springer
14 years 2 months ago
Voting in social networks
A voting system is a set of rules that a community adopts to take collective decisions. In this paper we study voting systems for a particular kind of community: electronically me...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Se...
PROCEDIA
2010
153views more  PROCEDIA 2010»
13 years 6 months ago
Conceptual framework for dynamic trust monitoring and prediction
The dynamic and collaborative nature of mobile and sensor networks raises the issue of how connected mobile devices can be trusted. Despite the existing security paradigms such as...
Olufunmilola Onolaja, Rami Bahsoon, Georgios Theod...
ICWSM
2010
13 years 9 months ago
TweetMotif: Exploratory Search and Topic Summarization for Twitter
We present TweetMotif, an exploratory search application for Twitter. Unlike traditional approaches to information retrieval, which present a simple list of messages, TweetMotif g...
Brendan O'Connor, Michel Krieger, David Ahn
PAMI
2002
149views more  PAMI 2002»
13 years 8 months ago
Region Tracking via Level Set PDEs without Motion Computation
Tracking regions in an image sequence is a challenging and di cult problem in image processing and computer vision, and at the same time, one that has many important applications:...
Abdol-Reza Mansouri