Sciweavers

163 search results - page 11 / 33
» Tight Approximability Results for Test Set Problems in Bioin...
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 6 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
BIOINFORMATICS
2007
66views more  BIOINFORMATICS 2007»
13 years 7 months ago
Gene expression network analysis and applications to immunology
We address the problem of using expression data and prior biological knowledge to identify differentially expressed pathways or groups of genes. Following an idea of Ideker et al...
Serban Nacu, Rebecca Critchley-Thorne, Peter Lee, ...
SSS
2009
Springer
133views Control Systems» more  SSS 2009»
14 years 1 days ago
A Metastability-Free Multi-synchronous Communication Scheme for SoCs
We propose a communication scheme for GALS systems with independent but approximately synchronized clock sources, which guarantees high-speed metastability-free communication betwe...
Thomas Polzer, Thomas Handl, Andreas Steininger
CGF
2006
125views more  CGF 2006»
13 years 7 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
FOCS
2009
IEEE
14 years 2 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans