Sciweavers

4103 search results - page 279 / 821
» Some results on the Collatz problem
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 8 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
AMI
2010
Springer
15 years 5 months ago
Reduction of Driver Stress Using AmI Technology while Driving in Motorway Merging Sections
Abstract. High average intensity of traffic and problems like traffic congestions, road safety, etc. are challenging problems striking highway operators in these days. With the bro...
Kashif Zia, Andreas Riener, Alois Ferscha
PVLDB
2010
92views more  PVLDB 2010»
15 years 5 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi
275
Voted
TSP
2011
106views more  TSP 2011»
15 years 1 months ago
Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
Chao Yu, Gaurav Sharma
PODC
2012
ACM
13 years 9 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...