Sciweavers

909 search results - page 108 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
EVOW
2007
Springer
15 years 7 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 5 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
TIFS
2008
157views more  TIFS 2008»
15 years 1 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 8 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
INFOCOM
2008
IEEE
15 years 7 months ago
Firewall Compressor: An Algorithm for Minimizing Firewall Policies
—A firewall is a security guard placed between a private network and the outside Internet that monitors all incoming and outgoing packets. The function of a firewall is to exam...
Alex X. Liu, Eric Torng, Chad R. Meiners