Sciweavers

3708 search results - page 262 / 742
» Approximating Betweenness Centrality
Sort
View
CGF
1998
86views more  CGF 1998»
15 years 6 months ago
Subdivision Schemes for Thin Plate Splines
Thin plate splines are a well known entity of geometric design. They are defined as the minimizer of a variational problem whose differential operators approximate a simple notio...
Henrik Weimer, Joe D. Warren
WWW
2011
ACM
15 years 1 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...
201
Voted
TSP
2010
15 years 1 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
ICPR
2006
IEEE
16 years 7 months ago
Chaining Planar Homographies for Fast and Reliable 3D Plane Tracking
This paper addresses the problem of tracking a 3D plane over a sequence of images acquired by a free moving camera, a task that is of central importance to a wide variety of visio...
Manolis I. A. Lourakis, Antonis A. Argyros