Results 1  10
of
8,072
MONOCHROMATIC TRIANGLES IN THREECOLOURED GRAPHS
"... Abstract. In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2coloured. Goodman [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured with more than two colours. In this paper, for ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2coloured. Goodman [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured with more than two colours. In this paper
Contextual Cueing: Implicit Learning and Memory of Visual Context Guides Spatial Attention
, 1998
"... this article. This paper has also benefited greatly from constructive feedback from Gordon Logan, Mike Stadler, and our other reviewers. We thank Joanie Sanchez for her assistance in running Experiment 1. This research was supported by a Social Science Faculty Research Award from Yale University. ..."
Abstract

Cited by 282 (25 self)
 Add to MetaCart
this article. This paper has also benefited greatly from constructive feedback from Gordon Logan, Mike Stadler, and our other reviewers. We thank Joanie Sanchez for her assistance in running Experiment 1. This research was supported by a Social Science Faculty Research Award from Yale University. Portions of this research were presented at the Annual Meeting of the Association for Research in Ophthalmology and Vision, Fort Lauderdale, FL, in May, 1997, and at the Annual Meeting of the Psychonomic Society, Philadelphia, PA, in November, 1997
Monochromatic Boxes in Colored Grids
, 2008
"... A ddimensional grid is a set of the form R = [a1] × · · · × [ad]. A ddimensional box is a set of the form {b1, c1} × · · · × {bd, cd}. When a grid is ccolored, must it admit a monochromatic box? If so, we say that R is cguaranteed. This question is a relaxation of one attack on boundin ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A ddimensional grid is a set of the form R = [a1] × · · · × [ad]. A ddimensional box is a set of the form {b1, c1} × · · · × {bd, cd}. When a grid is ccolored, must it admit a monochromatic box? If so, we say that R is cguaranteed. This question is a relaxation of one attack
Monochromatic BiClustering
"... We propose a natural cost function for the biclustering task, the monochromatic cost. This cost function is suitable for detecting meaningful homogeneous biclusters based on categorical valued input matrices. Such tasks arise in many applications, such as the analysis of social networks and in sys ..."
Abstract
 Add to MetaCart
We propose a natural cost function for the biclustering task, the monochromatic cost. This cost function is suitable for detecting meaningful homogeneous biclusters based on categorical valued input matrices. Such tasks arise in many applications, such as the analysis of social networks
Edge colorings of graphs avoiding monochromatic matchings of a given size
"... Let k and ℓ be positive integers. With a graph G, we associate the quantity ck,ℓ(G), the number of kcolorings of the edge set of G with no monochromatic matching of size ℓ. Consider the function ck,ℓ: N − → N given by ck,ℓ(n) = max {ck,ℓ(G): V (G)  = n}, the maximum of ck,ℓ(G) over all graphs ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let k and ℓ be positive integers. With a graph G, we associate the quantity ck,ℓ(G), the number of kcolorings of the edge set of G with no monochromatic matching of size ℓ. Consider the function ck,ℓ: N − → N given by ck,ℓ(n) = max {ck,ℓ(G): V (G)  = n}, the maximum of ck,ℓ(G) over all graphs
Coloring Graphs Using Two Colors while Avoiding Monochromatic Cycles
"... We consider the problem of deciding whether a given directed graph can be vertex partitioned into two acyclic subgraphs. Applications of this problem include testing rationality of collective consumption behavior, a subject in microeconomics. We prove that the problem is NPcomplete even for orien ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
for oriented graphs and argue that the existence of a constantfactor approximation algorithm is unlikely for an optimization version which maximizes the number of vertices that can be colored using two colors while avoiding monochromatic cycles. We present three exact algorithms, namely an integer
A System for Video Surveillance and Monitoring
, 2000
"... Under the threeyear Video Surveillance and Monitoring (VSAM) project (19971999), the Robotics Institute at Carnegie Mellon University (CMU) and the Sarnoff Corporation developed a system for autonomous Video Surveillance and Monitoring. The technical approach uses multiple, cooperative video s ..."
Abstract

Cited by 226 (1 self)
 Add to MetaCart
Under the threeyear Video Surveillance and Monitoring (VSAM) project (19971999), the Robotics Institute at Carnegie Mellon University (CMU) and the Sarnoff Corporation developed a system for autonomous Video Surveillance and Monitoring. The technical approach uses multiple, cooperative video
Monochromatic and Bichromatic Reverse Topk Queries
"... Nowadays, most applications return to the user a limited set of ranked results based on the individual user’s preferences, which are commonly expressed through topk queries. From the perspective of a manufacturer, it is imperative that her products appear in the highest ranked positions for many di ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
result set?”. Reverse topk queries are essential for manufacturers to assess the impact of their products in the market based on the competition. We formally define reverse topk queries and introduce two versions of the query, monochromatic and bichromatic. First, we provide a geometric interpretation
GroupInvariant Percolation on Graphs
 Geom. Funct. Anal
, 1999
"... . Let G be a closed group of automorphisms of a graph X . We relate geometric properties of G and X , such as amenability and unimodularity, to properties of Ginvariant percolation processes on X , such as the number of infinite components, the expected degree, and the topology of the components. O ..."
Abstract

Cited by 120 (40 self)
 Add to MetaCart
. Let G be a closed group of automorphisms of a graph X . We relate geometric properties of G and X , such as amenability and unimodularity, to properties of Ginvariant percolation processes on X , such as the number of infinite components, the expected degree, and the topology of the components
Results 1  10
of
8,072