2252 search results - page 294 / 451 » Lower Bounds for Dynamic Algorithms |
101
click to vote
ALT
2009
Springer
16 years 14 days ago
2009
Springer
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
109
Voted
SPIRE
2007
Springer
15 years 9 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
111
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
111
click to vote
ECML
2005
Springer
15 years 9 months ago
2005
Springer
We study estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers ...
104
Voted
COCO
2004
Springer
15 years 9 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...