Sciweavers

101 search results - page 16 / 21
» Grundy number and products of graphs
Sort
View
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
13 years 11 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 10 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
DAC
1994
ACM
13 years 11 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
ICAD
2004
13 years 9 months ago
Cultivating Design Patterns for Auditory Displays
Auditory Displays are quite well known in the research community, but very little of this experience is being transferred to product designers. The method of Design Patterns is we...
Matt Adcock, Stephen Barrass
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
11 years 10 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall