Sciweavers

1169 search results - page 86 / 234
» Degrees of monotone complexity
Sort
View
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
14 years 11 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 5 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ECIS
2000
15 years 5 months ago
Information Systems Research Education in Australasia: Continuing the Past or Gearing Up for the Future
As the information systems discipline grows, so do the number of programs offering graduate research degrees (GRD). In Australasia these include one year post-graduate (honors) pr...
Beverley G. Hope, M. Fergusson
INFOCOM
2010
IEEE
15 years 2 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran