3894 search results - page 527 / 779 » Approximation Algorithms for Biclustering Problems |
135
click to vote
JALC
2007
15 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
182
Voted
VTC
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
129
click to vote
CIKM
2004
Springer
15 years 9 months ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
141
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
129
click to vote
MONET
2006
15 years 4 months ago
2006
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...