3475 search results - page 100 / 695 » Backbones in Optimization and Approximation |
140
Voted
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
104
Voted
IPL
2008
15 years 2 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
112
click to vote
FUIN
2002
15 years 2 months ago
2002
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
239
Voted
POPL
2007
ACM
16 years 2 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
127
Voted
ADC
2006
Springer
15 years 8 months ago
2006
Springer
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...