Sciweavers

2721 search results - page 61 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
COLING
2010
15 years 1 months ago
A Comparative Study on Ranking and Selection Strategies for Multi-Document Summarization
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
Feng Jin, Minlie Huang, Xiaoyan Zhu
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 1 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
JIB
2007
124views more  JIB 2007»
15 years 6 months ago
Analysis of integrated biomolecular networks using a generic network analysis suite
The informative value of biomolecular networks has shifted from being solely information resources for possible cellular partners (whether these embody proteins, (ribo)nucleic aci...
Matthias Oesterheld, Hans-Werner Mewes, Volker St&...
PLDI
1995
ACM
15 years 9 months ago
Flow-Sensitive Interprocedural Constant Propagation
We present a flow-sensitive interprocedural constant propagation algorithm, which sttpports recursion while only performing one flow-sensitive analysis of each procedure. We prese...
Paul R. Carini, Michael Hind
OOPSLA
1999
Springer
15 years 10 months ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard