2698 search results - page 360 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
152
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
181
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
209
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
192
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
182
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...