1487 search results - page 45 / 298 » The Computational Complexity of Link Building |
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
TOG
2002
13 years 8 months ago
2002
This paper describes a new framework for video matting, the process of pulling a high-quality alpha matte and foreground from a video sequence. The framework builds upon technique...
ICDAR
2009
IEEE
14 years 3 months ago
2009
IEEE
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...
RAS
2008
13 years 8 months ago
2008
A still growing number of software concepts and framworks have been proposed to meet the challenges in the development of more and more complex robotic systems, like humanoids or n...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...