Sciweavers

4137 search results - page 329 / 828
» On the number of matchings of a tree
Sort
View
EOR
2007
117views more  EOR 2007»
15 years 6 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
VLDB
1998
ACM
173views Database» more  VLDB 1998»
15 years 6 months ago
Fast Image Retrieval Using Color-Spatial Information
Abstract. In this paper, we present an image retrieval system that employs both the color and spatial information of images to facilitate the retrieval process. The basic unit used...
Beng Chin Ooi, Kian-Lee Tan, Tat-Seng Chua, Wynne ...
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
16 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
VMV
2001
145views Visualization» more  VMV 2001»
15 years 8 months ago
Registering Real-Scene to Virtual Imagery Using Robust Image Features
The ability to locate objects in a real-time video and relate them to virtual objects in a database is important in a number of applications including visually-guided robotic navi...
Yi Lu Murphey, Jianxin Zhang, Michael DelRose
DM
2008
100views more  DM 2008»
15 years 7 months ago
Staircase tilings and k-Catalan structures
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that...
Silvia Heubach, Nelson Y. Li, Toufik Mansour