Sciweavers

2925 search results - page 266 / 585
» Information Complexity of Online Problems
Sort
View
186
Voted
ICSM
1997
IEEE
15 years 11 months ago
Dynamic Traceability Links Supported by a System Architecture Description
To reduce the effort spent on system comprehension during software maintenance, easy access to different type of information describing the system features is necessary. This is u...
Eirik Tryggeseth, Øystein Nytrø
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 7 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
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
HSNMC
2004
Springer
126views Multimedia» more  HSNMC 2004»
16 years 1 days ago
Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
Homayoun Yousefi'zadeh, Fatemeh Fazel, Hamid Jafar...
SEBD
2007
148views Database» more  SEBD 2007»
15 years 8 months ago
Containment of Conjunctive Object Meta-Queries
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...
Andrea Calì, Michael Kifer