Sciweavers

1798 search results - page 148 / 360
» A Tree for All Seasons
Sort
View
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
13 years 21 days 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
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
BROADNETS
2006
IEEE
14 years 3 months ago
An Energy Efficient and Accurate Slot Synchronization Scheme for Wireless Sensor Networks
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...
Lillian Dai, Prithwish Basu, Jason Redi
ISCC
2005
IEEE
114views Communications» more  ISCC 2005»
14 years 2 months ago
Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
François Ingelrest, David Simplot-Ryl
ASIACRYPT
2003
Springer
14 years 2 months ago
New Parallel Domain Extenders for UOWHF
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
Wonil Lee, Donghoon Chang, Sangjin Lee, Soo Hak Su...