3894 search results - page 616 / 779 » Approximation Algorithms for Biclustering Problems |
108
Voted
WACV
2005
IEEE
15 years 9 months ago
2005
IEEE
Adaptive background modeling/subtraction techniques are popular, in particular, because they are able to cope with background variations that are due to lighting variations. Unfor...
115
Voted
EUROGP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
111
Voted
CPM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
174
Voted
ICSM
2003
IEEE
15 years 8 months ago
2003
IEEE
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
114
Voted
CSCLP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...