Sciweavers

3958 search results - page 561 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
IEEEHPCS
2010
15 years 5 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
CNSM
2010
15 years 1 months ago
Semantic scheduling of active measurements for meeting network monitoring objectives
Network control and management techniques (e.g., dynamic path switching, on-demand bandwidth provisioning) rely on active measurements of end-to-end network status. These measureme...
Prasad Calyam, Lakshmi Kumarasamy, Füsun &Oum...
MOC
2011
15 years 1 months ago
An optimal adaptive mixed finite element method
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and ecient adaptive algorithms for mixed nite element m...
Carsten Carstensen, Hella Rabus
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 10 months ago
Gossip PCA
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
Satish Babu Korada, Andrea Montanari, Sewoong Oh
MOBICOM
2010
ACM
15 years 6 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao