Sciweavers

1498 search results - page 140 / 300
» Collection tree protocol
Sort
View
128
Voted
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
15 years 4 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
128
Voted
JMLR
2010
130views more  JMLR 2010»
14 years 9 months ago
MOA: Massive Online Analysis, a Framework for Stream Classification and Clustering
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA is designed to deal...
Albert Bifet, Geoff Holmes, Bernhard Pfahringer, P...
280
Voted
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
14 years 6 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
SENSYS
2005
ACM
15 years 8 months ago
A unifying link abstraction for wireless sensor networks
ng Link Abstraction for Wireless Sensor Networks Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, and Ion Stoica Computer Science Department In...
Joseph Polastre, Jonathan Hui, Philip Levis, Jerry...
143
Voted
FMCO
2003
Springer
121views Formal Methods» more  FMCO 2003»
15 years 7 months ago
TulaFale: A Security Tool for Web Services
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
Karthikeyan Bhargavan, Cédric Fournet, Andr...