Sciweavers

1760 search results - page 57 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
EUC
2005
Springer
14 years 2 months ago
RFIDcover - A Coverage Planning Tool for RFID Networks with Mobile Readers
Abstract. Radio Frequency Identification (RFID) finds use in numerous applications involving item identification and tracking. In a typical application, RFID tags are attached t...
S. Anusha, Sridhar Iyer
LCN
2003
IEEE
14 years 2 months ago
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
Jamil A. Shaikh, Julio Solano-González, Iva...
JGAA
2000
179views more  JGAA 2000»
13 years 8 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
13 years 10 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
14 years 2 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier