Sciweavers

4592 search results - page 650 / 919
» Framework for Studying Substitution
Sort
View
118
Voted
IPPS
2009
IEEE
15 years 7 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
119
Voted
ISDA
2009
IEEE
15 years 7 months ago
Valley-Adaptive Clearing Scheme for Multimodal Optimization Evolutionary Search
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...
Mostafa Mostafa Hashim Ellabaan, Yew-Soon Ong
114
Voted
ADBIS
2009
Springer
127views Database» more  ADBIS 2009»
15 years 7 months ago
Window Update Patterns in Stream Operators
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
Kostas Patroumpas, Timos K. Sellis
105
Voted
ADMI
2009
Springer
15 years 7 months ago
Towards Cooperative Predictive Data Mining in Competitive Environments
Abstract. We study the problem of predictive data mining in the competitive multi-agent setting, in which each agent is assumed to have some partial knowledge needed for correctly ...
Viliam Lisý, Michal Jakob, Petr Benda, Step...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 7 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu