132 search results - page 11 / 27 » Graph limits and hereditary properties |
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
194
click to vote
ICIAP
2009
ACM
16 years 7 months ago
2009
ACM
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
179
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
170
click to vote
ASAP
2010
IEEE
15 years 8 months ago
2010
IEEE
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
165
click to vote
HHCI
2000
15 years 10 months ago
2000
In this paper we discuss the design of computer-based haptic graphs for blind and visually impaired people with the support of our preliminary experimental results. Since visual i...