Sciweavers

3204 search results - page 497 / 641
» The Alcuin Number of a Graph
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...
Lirong Jian, Zheng Yang, Yunhao Liu
JCO
2010
123views more  JCO 2010»
15 years 5 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher
JUCS
2010
179views more  JUCS 2010»
15 years 5 months ago
Ontology Visualization: Tools and Techniques for Visual Representation of Semi-Structured Meta-Data
: Ontologies are used to represent a variety of domain knowledge and data collections, scopes, viewpoints and linked heterogeneous information sources. They range from simple topol...
Monika Lanzenberger, Jennifer Sampson, Markus Rest...
PAMI
2010
112views more  PAMI 2010»
15 years 5 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
TON
2010
158views more  TON 2010»
15 years 5 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...