Sciweavers

135 search results - page 21 / 27
» Approximability Distance in the Space of H-Colourability Pro...
Sort
View
WWW
2011
ACM
13 years 2 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
CVPR
2009
IEEE
15 years 2 months ago
Volterrafaces: Discriminant Analysis using Volterra Kernels
In this paper we present a novel face classification system where we represent face images as a spatial arrangement of image patches, and seek a smooth non-linear functional map...
Ritwik Kumar, Arunava Banerjee, Baba C. Vemuri
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 19 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
13 years 9 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
WINE
2010
Springer
149views Economy» more  WINE 2010»
13 years 5 months ago
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
Dimitris Fotakis, Christos Tzamos