Sciweavers

281 search results - page 26 / 57
» Balancing weight-balanced trees
Sort
View
ACCV
2009
Springer
14 years 3 months ago
Interactive Super-Resolution through Neighbor Embedding
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
Jian Pu, Junping Zhang, Peihong Guo, Xiaoru Yuan
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 3 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
VMCAI
2007
Springer
14 years 2 months ago
Shape Analysis of Single-Parent Heaps
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ADBIS
2004
Springer
134views Database» more  ADBIS 2004»
14 years 1 months ago
Towards Quadtree-Based Moving Objects Databases
Nowadays, one of the main research issues of great interest is the efficient tracking of mobile objects that enables the effective answering of spatiotemporal queries. This line o...
Katerina Raptopoulou, Michael Vassilakopoulos, Yan...
DMDW
2001
194views Management» more  DMDW 2001»
13 years 10 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch