Sciweavers

884 search results - page 84 / 177
» Linear-Input Subset Analysis
Sort
View
SDM
2004
SIAM
187views Data Mining» more  SDM 2004»
15 years 4 months ago
Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvri...
OPODIS
2003
15 years 4 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
APAL
2007
90views more  APAL 2007»
15 years 3 months ago
Guessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary s...
David Asperó
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...