Sciweavers

361 search results - page 63 / 73
» Relaxed Gabriel Graphs
Sort
View
EMMCVPR
2005
Springer
14 years 2 months ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ICDT
2005
ACM
125views Database» more  ICDT 2005»
14 years 2 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu
SIGIR
2004
ACM
14 years 2 months ago
Dependence language model for information retrieval
This paper presents a new dependence language modeling approach to information retrieval. The approach extends the basic language modeling approach based on unigram by relaxing th...
Jianfeng Gao, Jian-Yun Nie, Guangyuan Wu, Guihong ...
VAST
2004
ACM
14 years 2 months ago
Image-Based Registration of 3D-Range Data Using Feature Surface Elements
Digitizing real-life objects via range scanners, stereo vision or tactile sensors usually requires the composition of multiple range images. In this paper we exploit intensity ima...
Gerhard H. Bendels, Patrick Degener, Roland Wahl, ...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 2 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...