Sciweavers

649 search results - page 41 / 130
» An Improved Construction of Progression-Free Sets
Sort
View
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
14 years 11 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
117
Voted
PAMI
2011
14 years 7 months ago
Facial Deblur Inference Using Subspace Analysis for Recognition of Blurred Faces
— This paper proposes a novel method for recognizing faces degraded by blur using deblurring of facial images. The main issue is how to infer a Point Spread Function (PSF) repres...
Masashi Nishiyama, Abdenour Hadid, Hidenori Takesh...
97
Voted
CAIP
2009
Springer
211views Image Analysis» more  CAIP 2009»
15 years 7 months ago
Contextual-Guided Bag-of-Visual-Words Model for Multi-class Object Categorization
Abstract. Bag-of-words model (BOW) is inspired by the text classification problem, where a document is represented by an unsorted set of contained words. Analogously, in the objec...
Mehdi Mirza-Mohammadi, Sergio Escalera, Petia Rade...
113
Voted
ICDCS
2008
IEEE
15 years 7 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
ICANN
2007
Springer
15 years 4 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel