118 search results - page 18 / 24 » Greedy algorithms for on-line set-covering and related probl... |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
111
click to vote
PODS
2007
ACM
15 years 9 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
ICDCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
SIAMJO
2002
14 years 9 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...