Sciweavers

126 search results - page 3 / 26
» Finding links and initiators: a graph reconstruction problem
Sort
View
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 2 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
ICPR
2010
IEEE
13 years 10 months ago
Finding Multiple Object Instances with Occlusion
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
Ge Guo, Tingting Jiang, Yizhou Wang, Wen Gao
ICPR
2004
IEEE
14 years 6 months ago
Finding Region Correspondences for Wide Baseline Stereo
This study addresses the problem of finding correspondences for wide baseline stereo. Texture has traditionally been utilised as a single-image cue for 3D shape reconstruction (sh...
Dmitry Chetverikov, Zoltán Megyesi, Zsolt J...
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
13 years 9 months ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...
STACS
2010
Springer
14 years 9 days ago
Optimal Query Complexity for Reconstructing Hypergraphs
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let G be a weighted hidden h...
Nader H. Bshouty, Hanna Mazzawi