Sciweavers

1308 search results - page 90 / 262
» Let's Have a Conversation
Sort
View
APAL
1998
71views more  APAL 1998»
14 years 11 months ago
On the Finiteness of the Recursive Chromatic Number
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
William I. Gasarch, Andrew C. Y. Lee
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
14 years 11 months ago
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
Edward A. Bender, S. Gill Williamson
RSA
1998
54views more  RSA 1998»
14 years 11 months ago
Random disease on the square grid
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
József Balogh, Gábor Pete
SIAMDM
2002
52views more  SIAMDM 2002»
14 years 11 months ago
Testing k-colorability
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
Noga Alon, Michael Krivelevich
PRL
2007
145views more  PRL 2007»
14 years 10 months ago
Multiple color texture map fusion for 3D models
A commonly encountered problem when creating 3D models of large real scenes is unnatural color texture fusion. Due to variations in lighting and camera settings (both manual and a...
Nobuyuki Bannai, Robert B. Fisher, Alexander Agath...