Sciweavers

1729 search results - page 345 / 346
» Bound Graph Polysemy
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...
ICTAI
2009
IEEE
13 years 5 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
DAM
2011
13 years 2 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
WWW
2011
ACM
13 years 2 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
PVLDB
2010
220views more  PVLDB 2010»
13 years 2 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel