6142 search results - page 865 / 1229 » The Complexity of Partition Functions |
190
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
177
click to vote
FPGA
2008
ACM
15 years 8 months ago
2008
ACM
Functional full-system simulators are powerful and versatile research tools for accelerating architectural exploration and advanced software development. Their main shortcoming is...
183
click to vote
IJCAI
2007
15 years 8 months ago
2007
The goal of transfer learning is to use the knowledge acquired in a set of source tasks to improve performance in a related but previously unseen target task. In this paper, we pr...
177
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
166
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...