Sciweavers

699 search results - page 8 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
TACS
1994
Springer
15 years 1 months ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
65
Voted
ICRA
2008
IEEE
146views Robotics» more  ICRA 2008»
15 years 4 months ago
Visual servoing based on Gaussian mixture models
— In this paper we present a novel approach to robust visual servoing. This method removes the feature tracking step from a typical visual servoing algorithm. We do not need corr...
A. H. Abdul Hafez, Supreeth Achar, C. V. Jawahar
83
Voted
NETWORK
2010
122views more  NETWORK 2010»
14 years 4 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
64
Voted
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
15 years 10 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
IPPS
2005
IEEE
15 years 3 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin