Sciweavers

4860 search results - page 262 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
100
Voted
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
16 years 1 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
107
Voted
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
15 years 19 days ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov
MOBIHOC
2007
ACM
16 years 7 days ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
SPAA
2004
ACM
15 years 6 months ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
ALT
2004
Springer
15 years 9 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...