Sciweavers

6120 search results - page 846 / 1224
» The Power of Linear Functions
Sort
View
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 10 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
PARLE
1987
15 years 10 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch
AAAI
2008
15 years 9 months ago
Classification by Discriminative Regularization
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...
Bin Zhang, Fei Wang, Ta-Hsin Li, Wen Jun Yin, Jin ...
AAAI
2008
15 years 9 months ago
On Discriminative Semi-Supervised Classification
The recent years have witnessed a surge of interests in semi-supervised learning methods. A common strategy for these algorithms is to require that the predicted data labels shoul...
Fei Wang, Changshui Zhang
AAAI
2008
15 years 9 months ago
New Compilation Languages Based on Structured Decomposability
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
Knot Pipatsrisawat, Adnan Darwiche