Sciweavers

739 search results - page 97 / 148
» Sorting Algorithms
Sort
View
ICIAR
2005
Springer
14 years 1 months ago
Marrying Level Lines for Stereo or Motion
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
Nikom Suvonvorn, Samia Bouchafa, Bertrand Zavidovi...
MDM
2004
Springer
130views Communications» more  MDM 2004»
14 years 1 months ago
Opportunistic Resource Exchange in Inter-Vehicle Ad-Hoc Networks
In this paper we examine resource discovery in inter-vehicle ad-hoc networks in an urban area, where moving vehicles communicate with each other via short-range wireless transmiss...
Bo Xu, Aris M. Ouksel, Ouri Wolfson
IPPS
2002
IEEE
14 years 16 days ago
Aligning Two Fragmented Sequences
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 4 days ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
AIMSA
2000
Springer
13 years 12 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva