Sciweavers

632 search results - page 70 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 8 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
IPPS
1998
IEEE
14 years 1 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
IPL
2006
97views more  IPL 2006»
13 years 8 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 5 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
INFOCOM
2007
IEEE
14 years 3 months ago
pDCS: Security and Privacy Support for Data-Centric Sensor Networks
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...
Min Shao, Sencun Zhu, Wensheng Zhang, Guohong Cao