9842 search results - page 1342 / 1969 » The Complexity of the Matching-Cut Problem |
296
click to vote
ICDE
2009
IEEE
16 years 9 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
330
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
309
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
174
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
186
Voted
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...