3818 search results - page 231 / 764 » Word Problems on Compressed Words |
167
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
282
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
164
click to vote
WORDS
2005
IEEE
16 years 3 days ago
2005
IEEE
The main functionality of the Domain Name System (DNS) is to translate symbolic names into IP addresses. Due to the criticality of DNS for the proper functioning of the Internet, ...
166
click to vote
IJCAI
2001
15 years 8 months ago
2001
Consider a supervised learning problem in which examples contain both numerical- and text-valued features. To use traditional featurevector-based learning methods, one could treat...
176
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Conventional approaches to automatic image annotation usually suffer from two problems: (1) They cannot guarantee a good semantic coherence of the annotated words for each image, ...