Sciweavers

3396 search results - page 492 / 680
» Tree representations of graphs
Sort
View
ESANN
2004
15 years 7 months ago
Neural methods for non-standard data
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
Barbara Hammer, Brijnesh J. Jain
CCCG
2003
15 years 7 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
176
Voted
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
PDPTA
2003
15 years 7 months ago
A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
Jyh-Wen Mao, Chang-Biau Yang
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 6 months ago
Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
Mugurel Ionut Andreica, Vasile Deac, Stelian Tipa