Sciweavers

2715 search results - page 329 / 543
» Total Generalized Variation
Sort
View
152
Voted
FLAIRS
2004
15 years 5 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
ICVGIP
2004
15 years 5 months ago
A Robust Nonparametric Estimation Framework for Implicit Image Models
Robust model fitting is important for computer vision tasks due to the occurrence of multiple model instances, and, unknown nature of noise. The linear errors-in-variables (EIV) m...
Himanshu Arora, Maneesh Singh, Narendra Ahuja
NETWORKING
2004
15 years 5 months ago
Loss Strategies for Competing TCP/IP Connections
We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its t...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...
SIROCCO
2001
15 years 5 months ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin
119
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 5 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell