Sciweavers

45 search results - page 9 / 9
» mst 2010
Sort
View
ICDT
2010
ACM
163views Database» more  ICDT 2010»
13 years 4 months ago
Composing Local-As-View Mappings
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia Arocena, Ariel Fuxman, Renee Miller
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 3 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
14 years 2 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
ETRA
2010
ACM
213views Biometrics» more  ETRA 2010»
13 years 6 months ago
Qualitative and quantitative scoring and evaluation of the eye movement classification algorithms
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
Oleg V. Komogortsev, Sampath Jayarathna, Do Hyong ...
SDM
2010
SIAM
283views Data Mining» more  SDM 2010»
13 years 6 months ago
Cascading Spatio-temporal Pattern Discovery: A Summary of Results
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
Pradeep Mohan, Shashi Shekhar, James A. Shine, Jam...