Sciweavers

3136 search results - page 616 / 628
» Complex networks and evolutionary computation
Sort
View
CODASPY
2011
14 years 1 months ago
Privacy-preserving activity scheduling on mobile devices
—Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users’ personal schedules. Users also access popular contextbase...
Igor Bilogrevic, Murtuza Jadliwala, Jean-Pierre Hu...
PODC
2009
ACM
15 years 10 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
ICML
2009
IEEE
15 years 10 months ago
Large-scale deep unsupervised learning using graphics processors
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
Rajat Raina, Anand Madhavan, Andrew Y. Ng
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 9 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
PODS
2008
ACM
109views Database» more  PODS 2008»
15 years 9 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura