2194 search results - page 229 / 439 » Improving HLRTA*( k ) |
118
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
119
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—Intelligent mobile terminals (or users) of next generation wireless networks are expected to initiate voice over IP (VoIP) calls using session set-up protocols like H.323 or SIP...
118
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
119
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
The Conditional Random Fields (CRF) model, using
patch-based classification bound with context information,
has recently been widely adopted for image segmentation/
labeling. In...