Sciweavers

15033 search results - page 345 / 3007
» Complexity Theory and Algorithms
Sort
View
188
Voted
FOCS
2007
IEEE
16 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
WWW
2011
ACM
15 years 1 months ago
Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitte
There is a widespread intuitive sense that different kinds of information spread differently on-line, but it has been difficult to evaluate this question quantitatively since it ...
Daniel M. Romero, Brendan Meeder, Jon M. Kleinberg
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
GIS
2005
ACM
16 years 8 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
183
Voted
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie