656 search results - page 47 / 132 » Minimal non-convex words |
139
click to vote
DM
2008
15 years 6 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
160
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
147
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
151
click to vote
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
Increasing cache latencies limit L1 cache sizes. In this paper we investigate restrictive compression techniques for level 1 data cache, to avoid an increase in the cache access l...
172
click to vote
RIDE
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper presents a method of automatically creating hypermedia documents from conventional transcriptions of television programs. Using parallel text alignment techniques, the ...