Sciweavers

332 search results - page 23 / 67
» The Monochromatic Column problem
Sort
View
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 10 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
VISUAL
1999
Springer
14 years 2 months ago
Genetic Algorithm for Weights Assignment in Dissimilarity Function for Trademark Retrieval
Abstract. Trademark image retrieval is becoming an important application for logo registry, veri cation, and design. There are two major problems about the current approaches to tr...
David Yuk-Ming Chan, Irwin King
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
14 years 2 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
DM
2010
140views more  DM 2010»
13 years 10 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
13 years 9 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...