154 search results - page 11 / 31 » Algorithms for Implicit Hitting Set Problems |
75
Voted
CIMAGING
2010
14 years 11 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
161
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
66
Voted
DM
2010
14 years 9 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We describe and critique the convergence properties of filterbased evolutionary pattern search algorithms (F-EPSAs). F-EPSAs implicitly use a filter to perform a multi-...