1442 search results - page 135 / 289 » Finding interesting things |
166
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
161
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Three-dimensional shape searching is a problem of current interest in several different fields. Most techniques have been developed for a particular domain and reduce a shape into...
132
click to vote
JDWM
2007
15 years 6 months ago
2007
The PAKDD Competition 2006 involved the problem of classifying mobile telecom network customers into 2G and 3G, with the ultimate aim of identifying existing 2G network customers w...
167
click to vote
BMCBI
2004
15 years 5 months ago
2004
Background: Due to the high cost and low reproducibility of many microarray experiments, it is not surprising to find a limited number of patient samples in each study, and very f...
156
click to vote
ECCC
2000
15 years 5 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...