Sciweavers

14078 search results - page 2208 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
SEMWEB
2007
Springer
16 years 1 months ago
ASMOV Results for OAEI 2007
Numerous ontology alignment algorithms have appeared in the literature in recent years, but only a few make use of the semantics enclosed within the ontologies in order to improve ...
Yves R. Jean-Mary, Mansur R. Kabuka
IUI
2004
ACM
16 years 15 days ago
Robust sketched symbol fragmentation using templates
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
Heloise Hwawen Hse, Michael Shilman, A. Richard Ne...
ICALP
2004
Springer
16 years 14 days ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
WPES
2003
ACM
16 years 10 days ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 7 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
« Prev « First page 2208 / 2816 Last » Next »