Sciweavers

1101 search results - page 189 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
WWW
2011
ACM
14 years 8 months ago
Predicting popular messages in Twitter
Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the c...
Liangjie Hong, Ovidiu Dan, Brian D. Davison
RECOMB
2005
Springer
16 years 2 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
CP
2003
Springer
15 years 7 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 6 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 4 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...