14518 search results - page 2611 / 2904 » Two Problems for Sophistication |
126
click to vote
ISI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Those who want to conceal the content of their communications can do so by replacing words that might trigger attention by other words or locutions that seem more ordinar...
153
click to vote
JMLR
2008
15 years 4 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
138
click to vote
DAM
2007
15 years 4 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
163
click to vote
JSAT
2008
15 years 4 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
108
click to vote
JCT
2006
15 years 4 months ago
2006
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...