14548 search results - page 2636 / 2910 » The Optimal Path-Matching Problem |
145
click to vote
CSR
2007
Springer
16 years 24 days ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
164
click to vote
DCOSS
2007
Springer
16 years 24 days ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
182
click to vote
ECML
2007
Springer
16 years 24 days ago
2007
Springer
Boosting is a simple yet powerful modeling technique that is used in many machine learning and data mining related applications. In this paper, we propose a novel scale-space based...
186
click to vote
ECML
2007
Springer
16 years 24 days ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
180
click to vote
ER
2007
Springer
16 years 24 days ago
2007
Springer
Schema mappings come in different flavors: simple correspondences are produced by schema matchers, intensional mappings are used for schema integration. However, the execution of ...