1068 search results - page 89 / 214 » Factorization as a Rank 1 Problem |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
104
click to vote
ECIR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. We present a framework that assesses relevance with respect to several relevance criteria, by combining the query-dependent and query-independent evidence indicating thes...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
CLEF
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Esfinge is a general domain Portuguese question answering system. It tries to apply simple techniques to large amounts of text. Esfinge participated last year in the mono...