7129 search results - page 1119 / 1426 » Approximation Algorithms for Treewidth |
123
Voted
SSD
2005
Springer
15 years 9 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
135
Voted
VLBV
2005
Springer
15 years 9 months ago
2005
Springer
The Multidimensional Multiscale Parser (MMP) algorithm has been proposed recently as a universal data coding method. MMP has proved to be a very powerful coding method for images, ...
114
Voted
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
118
click to vote
WABI
2005
Springer
15 years 9 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
131
Voted
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...