Sciweavers

230 search results - page 24 / 46
» Minimum Spanning Tree Problem with Label Selection
Sort
View
TCAD
2002
128views more  TCAD 2002»
13 years 7 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
ADHOCNETS
2010
Springer
13 years 5 months ago
Balanced Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
Min Chen, Wei Cai, Sergio González-Valenzue...
STACS
2001
Springer
13 years 12 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
NIPS
2004
13 years 9 months ago
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
Yves Grandvalet, Yoshua Bengio
KDD
1997
ACM
109views Data Mining» more  KDD 1997»
13 years 11 months ago
Selecting Features by Vertical Compactness of Data
Feature selection is a data preprocessing step for classi cation and data mining tasks. Traditionally, feature selection is done by selecting a minimum number of features that det...
Ke Wang, Suman Sundaresh