Sciweavers

646 search results - page 73 / 130
» Generalized connected domination in graphs
Sort
View
SPIRE
2005
Springer
14 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
EMNLP
2007
13 years 10 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
BMCBI
2004
120views more  BMCBI 2004»
13 years 8 months ago
Clustering under the line graph transformation: application to reaction network
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 12 days ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...