Sciweavers

1272 search results - page 243 / 255
» The Set Cover with Pairs Problem
Sort
View
ECCV
2010
Springer
14 years 1 months ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 12 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
FOCS
2000
IEEE
13 years 11 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
CSFW
2010
IEEE
13 years 11 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
13 years 9 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane