Sciweavers

175 search results - page 35 / 35
» Approximation Algorithms for Flexible Job Shop Problems
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 5 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
TIP
2010
115views more  TIP 2010»
13 years 26 days ago
Constrained and Dimensionality-Independent Path Openings
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
Cris L. Luengo Hendriks
TCSV
2008
195views more  TCSV 2008»
13 years 6 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 6 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
MKWI
2008
190views Business» more  MKWI 2008»
13 years 7 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb