Sciweavers

626 search results - page 93 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
14 years 11 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
ADHOC
2005
122views more  ADHOC 2005»
14 years 11 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
14 years 6 months ago
Nonholonomic source seeking in switching random fields
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pa...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
15 years 11 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
AINA
2005
IEEE
15 years 5 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko