Sciweavers

12519 search results - page 36 / 2504
» Approximation Problems Categories
Sort
View
EACL
1993
ACL Anthology
15 years 3 months ago
Tuples, Discontinuity, and Gapping in Categorial Grammar
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A ‘tuple’ operation introduced in [Solias, 1992] is defined as a mode of...
Glyn Morrill, Teresa Solias
143
Voted
CVPR
2007
IEEE
16 years 4 months ago
Discriminative Cluster Refinement: Improving Object Category Recognition Given Limited Training Data
A popular approach to problems in image classification is to represent the image as a bag of visual words and then employ a classifier to categorize the image. Unfortunately, a si...
Liu Yang, Rong Jin, Caroline Pantofaru, Rahul Sukt...
119
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
COMGEO
2012
ACM
13 years 10 months ago
Preserving geometric properties in reconstructing regions from internal and nearby points
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
Ernest Davis
142
Voted
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 2 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy