1822 search results - page 246 / 365 » The Method of Assigning Incidences |
162
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
Biological data, such as gene expression profiles or protein sequences, is often organized in a hierarchy of classes, where the instances assigned to "nearby" classes in...
162
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— Although the LUT (look-up table) size of FPGAs has been optimized for general applications, complicated designs may contain a large number of cascaded LUTs between flip-flops...
191
click to vote
SASO
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
183
click to vote
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
204
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...