Sciweavers

12519 search results - page 8 / 2504
» Approximation Problems Categories
Sort
View
85
Voted
ACL
2007
15 years 1 months ago
Inducing Combinatory Categorial Grammars with Genetic Algorithms
This paper proposes a novel approach to the induction of Combinatory Categorial Grammars (CCGs) by their potential affinity with the Genetic Algorithms (GAs). Specifically, CCGs...
Elias Ponvert
COMPGEOM
2009
ACM
15 years 6 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
CVPR
2006
IEEE
16 years 1 months ago
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingl...
Svetlana Lazebnik, Cordelia Schmid, Jean Ponce
ICPR
2002
IEEE
16 years 23 days ago
Category-Dependent Feature Extraction for Recognition of Degraded Handwritten Characters
Conventional methods for recognizing multiple fonts and handwriting are generally robust against deformation but are weak against degradation. This paper proposes a category-depen...
Minoru Mori, Minako Sawaki, Norihiro Hagita
SIGCOMM
2010
ACM
14 years 12 months ago
Stochastic approximation algorithm for optimal throughput performance of wireless LANs
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
Sundaresan Krishnan, Prasanna Chaporkar