154 search results - page 19 / 31 » Algorithms for Implicit Hitting Set Problems |
70
Voted
CIKM
2000
Springer
15 years 1 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Publication
We present a solution to the mesh tangling problem in surface tracking. Using an explicit triangle mesh to track the location of a surface as it moves in three dimensions has many ...
TVLSI
1998
14 years 9 months ago
1998
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...