3874 search results - page 376 / 775 » Approximation Algorithms for k-hurdle Problems |
202
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
170
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
178
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
168
click to vote
FOCM
2007
15 years 6 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
256
Voted
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...