Sciweavers

253 search results - page 50 / 51
» Edge and Node Searching Problems on Trees
Sort
View
FOCS
1995
IEEE
13 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
CIKM
2009
Springer
14 years 1 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Skyline Query Processing on Peer-to-Peer Networks
Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem...
Shiyuan Wang, Beng Chin Ooi, Anthony K. H. Tung, L...
PAA
2002
13 years 6 months ago
Hierarchical Fusion of Multiple Classifiers for Hyperspectral Data Analysis
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Shailesh Kumar, Joydeep Ghosh, Melba M. Crawford
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 1 months ago
Evolutionary optimization of multistage interconnection networks performance
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
Jirí Jaros