Sciweavers

295 search results - page 10 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
15 years 1 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
CN
2004
108views more  CN 2004»
14 years 10 months ago
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing ...
Samphel Norden, Milind M. Buddhikot, Marcel Waldvo...
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
15 years 4 months ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
ICNP
2007
IEEE
15 years 4 months ago
Multicast Algorithms for Multi-Channel Wireless Mesh Networks
— Multicast is a key technology that provides efficient data communication among a set of nodes for wireless multi-hop networks. In sensor networks and MANETs, multicast algorit...
Guo-Kai Zeng, Bo Wang 0001, Yong Ding, Li Xiao, Ma...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams