Sciweavers

1327 search results - page 212 / 266
» Path following algorithm for the graph matching problem
Sort
View
STACS
2001
Springer
15 years 6 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
16 years 1 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
EDBT
2009
ACM
120views Database» more  EDBT 2009»
15 years 8 months ago
Retrieving meaningful relaxed tightest fragments for XML keyword search
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
Lingbo Kong, Rémi Gilleron, Aurélien...
ICB
2009
Springer
119views Biometrics» more  ICB 2009»
15 years 8 months ago
Multi-Region Probabilistic Histograms for Robust and Scalable Identity Inference
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
Conrad Sanderson, Brian C. Lovell
CVPR
2010
IEEE
15 years 5 months ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li