520 search results - page 47 / 104 » New Complexity Results for Classical Planning Benchmarks |
158
click to vote
PAMI
2006
15 years 6 months ago
2006
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
186
click to vote
VTC
2008
IEEE
16 years 20 days ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
154
click to vote
HIPEAC
2005
Springer
15 years 11 months ago
2005
Springer
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper pre...
205
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
With the increasing popularity of practical vision systems and smart phones, text detection in natural scenes becomes a critical yet challenging task. Most existing methods have f...
171
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...