Sciweavers

90 search results - page 16 / 18
» Finding the Most Vital Node of a Shortest Path
Sort
View
ICDE
2011
IEEE
240views Database» more  ICDE 2011»
12 years 11 months ago
Similarity measures for multidimensional data
— How similar are two data-cubes? In other words, the question under consideration is: given two sets of points in a multidimensional hierarchical space, what is the distance val...
Eftychia Baikousi, Georgios Rogkakos, Panos Vassil...
BMCBI
2008
96views more  BMCBI 2008»
13 years 7 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
BROADNETS
2004
IEEE
13 years 11 months ago
Diverse Routing for Shared Risk Resource Groups (SRRG) Failures in WDM Optical Networks
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
Pallab Datta, Arun K. Somani
CGO
2003
IEEE
13 years 11 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
14 years 8 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal