Sciweavers

1469 search results - page 219 / 294
» Approximate polynomial decomposition
Sort
View
STOC
2012
ACM
222views Algorithms» more  STOC 2012»
13 years 8 months ago
An analysis of one-dimensional schelling segregation
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
Christina Brandt, Nicole Immorlica, Gautam Kamath,...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
WWW
2008
ACM
16 years 7 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
ATAL
2009
Springer
16 years 26 days ago
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....