Sciweavers

801 search results - page 138 / 161
» Minimal Locked Trees
Sort
View
MP
1998
117views more  MP 1998»
14 years 9 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
TIT
1998
127views more  TIT 1998»
14 years 9 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
PVLDB
2008
94views more  PVLDB 2008»
14 years 9 months ago
Dynamic active probing of helpdesk databases
Helpdesk databases are used to store past interactions between customers and companies to improve customer service quality. One common scenario of using helpdesk database is to fi...
Shenghuo Zhu, Tao Li, Zhiyuan Chen, Dingding Wang,...
INFOCOM
2010
IEEE
14 years 8 months ago
Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks
—In-network aggregation has become a promising technique for improving the energy efficiency of wireless sensor networks. Aggregating data at various nodes in the network result...
Changhee Joo, Jin-Ghoo Choi, Ness B. Shroff
PVLDB
2008
167views more  PVLDB 2008»
14 years 8 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...