2031 search results - page 70 / 407 » On Tree-Constrained Matchings and Generalizations |
153
click to vote
DEBS
2011
ACM
2011
ACM
DejaVu: a complex event processing system for pattern matching over live and historical data streams
14 years 1 months ago
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
3DIM
2003
IEEE
15 years 1 months ago
2003
IEEE
Precise digital 3D models of indoor environments are needed in several applications, e.g., facility management, architecture, rescue and inspection robotics. This paper presents a...
AAAI
2010
14 years 11 months ago
2010
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
IJCAI
2007
14 years 11 months ago
2007
In order to evaluate ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results with some reference. The most prominent comparis...