4377 search results - page 98 / 876 » Mass problems and randomness |
154
click to vote
FCT
2009
Springer
16 years 2 days ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
181
click to vote
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
188
click to vote
WADS
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
220
click to vote
RECOMB
2002
Springer
16 years 5 months ago
2002
Springer
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
199
click to vote
JMLR
2008
15 years 5 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...