236 search results - page 26 / 48 » A New Neighborhood Based on Improvement Graph for Robust Gra... |
PPAM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
FUIN
2006
13 years 8 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
ICIP
2009
IEEE
14 years 6 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
NIPS
2008
13 years 10 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...