Sciweavers

340 search results - page 20 / 68
» Approximate equality is no fuzzy equality
Sort
View
149
Voted
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
15 years 5 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
BMCBI
2007
207views more  BMCBI 2007»
15 years 5 months ago
Discovering biomarkers from gene expression data for predicting cancer subgroups using neural networks and relational fuzzy clus
Background: The four heterogeneous childhood cancers, neuroblastoma, non-Hodgkin lymphoma, rhabdomyosarcoma, and Ewing sarcoma present a similar histology of small round blue cell...
Nikhil R. Pal, Kripamoy Aguan, Animesh Sharma, Shu...
137
Voted
FOCS
1998
IEEE
15 years 9 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 9 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
WINE
2010
Springer
178views Economy» more  WINE 2010»
15 years 3 months ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...