Sciweavers

740 search results - page 88 / 148
» An approximation ratio for biclustering
Sort
View
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
15 years 1 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 12 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
ENGL
2006
108views more  ENGL 2006»
14 years 12 months ago
A Fuzzy-Neuro Model for Normal Concrete Mix Design
: Concrete mix design is a process of proportioning the ingredients in right proportions. Though it is based on sound technical principles and heuristics, the entire process is not...
M. C. Nataraja, M. A. Jayaram, C. N. Ravikumar
JCO
2006
103views more  JCO 2006»
14 years 12 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
JMLR
2006
117views more  JMLR 2006»
14 years 12 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon