1871 search results - page 137 / 375 » The Ephemeral Pairing Problem |
PKDD
2009
Springer
15 years 6 months ago
2009
Springer
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
114
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
108
click to vote
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
XPU
2007
Springer
15 years 5 months ago
2007
Springer
Testing is an essential part of an agile process as test is automated and tends to take the role of specifications in place of documents. However, whenever test cases are faulty, d...
118
click to vote
3DPVT
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, a unified, segmentation-based approach is proposed to deal with both stereo reconstruction and moving objects detection problems using multiple stereo mosaics. Each...