Sciweavers

1095 search results - page 114 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View

Presentation
945views
13 years 10 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
TSP
2010
14 years 11 months ago
Distributed sparse linear regression
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
Gonzalo Mateos, Juan Andrés Bazerque, Georg...
KDD
1998
ACM
84views Data Mining» more  KDD 1998»
15 years 9 months ago
Similarity of Attributes by External Probes
In data mining, similarity or distance between attributes is one of the central notions. Such a notion can be used to build attribute hierarchies etc. Similarity metrics can be us...
Gautam Das, Heikki Mannila, Pirjo Ronkainen
IPPS
2009
IEEE
15 years 11 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
148
Voted
CONCUR
1999
Springer
15 years 9 months ago
Validating Firewalls in Mobile Ambients
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...
Flemming Nielson, Hanne Riis Nielson, René ...