Sciweavers

1147 search results - page 90 / 230
» Differential Matching Constraints
Sort
View
PETRA
2009
ACM
14 years 3 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
DISOPT
2008
93views more  DISOPT 2008»
13 years 9 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
VLDB
2003
ACM
165views Database» more  VLDB 2003»
14 years 9 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...
ICFP
2010
ACM
13 years 10 months ago
Matching lenses: alignment and view update
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
Davi M. J. Barbosa, Julien Cretin, Nate Foster, Mi...
ICASSP
2010
IEEE
13 years 9 months ago
Automatic matched filter recovery via the audio camera
The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental re ections....
Adam O'Donovan, Ramani Duraiswami, Dmitry N. Zotki...