Sciweavers

273 search results - page 34 / 55
» Improving program slicing with dynamic points-to data
Sort
View
ICALP
2010
Springer
15 years 2 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
72
Voted
ICALP
2005
Springer
15 years 3 months ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
ICPP
2003
IEEE
15 years 2 months ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta
BMCBI
2010
193views more  BMCBI 2010»
14 years 4 months ago
Mayday - integrative analytics for expression data
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...
Florian Battke, Stephan Symons, Kay Nieselt
ICNP
2009
IEEE
15 years 4 months ago
Scalable Video Multicast in Multi-carrier Wireless Data Systems
—Future 4G cellular networks are featured with high data rate and improved coverage, which will enable realtime video multicast and broadcast services. Scalable video coding is v...
Peilong Li, Honghai Zhang, Baohua Zhao, Sampath Ra...