3894 search results - page 164 / 779 » Approximation Algorithms for Biclustering Problems |
173
click to vote
CCCG
1998
15 years 7 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
151
click to vote
ICDM
2007
IEEE
16 years 24 days ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
198
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
174
click to vote
EOR
2008
15 years 6 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
204
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...