Sciweavers

2192 search results - page 113 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IACR
2011
141views more  IACR 2011»
12 years 7 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
CVPR
2009
IEEE
15 years 3 months ago
Monitoring, Recognizing and Discovering Social Networks
This work addresses the important problem of the discovery and analysis of social networks from surveillance video. A computer vision approach to this problem is made possible b...
Ting Yu, Ser Nam Lim, Kedar A. Patwardhan, Nils Kr...
ICDAR
2011
IEEE
12 years 7 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...
AAAI
2007
13 years 10 months ago
Refutation by Randomised General Resolution
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
Steven David Prestwich, Inês Lynce
NIPS
2004
13 years 9 months ago
Discriminant Saliency for Visual Recognition from Cluttered Scenes
Saliency mechanisms play an important role when visual recognition must be performed in cluttered scenes. We propose a computational definition of saliency that deviates from exis...
Dashan Gao, Nuno Vasconcelos