Sciweavers

807 search results - page 58 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
CG
2005
Springer
15 years 3 months ago
Hyper-Resolution: Image detail reconstruction through parametric edges
Hyper-Resolution, a new technique for super-resolution reconstruction of images, is based on matching lowresolution target image details to their high-resolution counterparts from...
Lijun Yin, Matt T. Yourst
113
Voted
ICML
2007
IEEE
16 years 4 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
215
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 5 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
145
Voted
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 4 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
258
Voted
ICDE
2008
IEEE
194views Database» more  ICDE 2008»
16 years 5 months ago
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
Dong Xin, Jiawei Han