Sciweavers

6110 search results - page 317 / 1222
» Approximate Computing
Sort
View
CORR
2011
Springer
204views Education» more  CORR 2011»
15 years 1 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
ICPR
2006
IEEE
16 years 7 months ago
Object Localization Based on Directional Information: Case of 2D Raster Data
A directional spatial relationship to a reference object (e.g., "east of the post office") can be represented by a spatial template. The template partitions the space in...
JingBo Ni, Pascal Matsakis, Xin Wang
FSTTCS
2006
Springer
15 years 10 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
EDBT
2010
ACM
246views Database» more  EDBT 2010»
16 years 1 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown