Sciweavers

1396 search results - page 53 / 280
» Succinct Dynamic Data Structures
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 7 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
116
Voted
IJCNN
2006
IEEE
15 years 8 months ago
Combining Multi-Frame Images for Enhancement Using Self-Delaying Dynamic Networks
Abstract— This paper presents the use of a newly created network structure known as a Self-Delaying Dynamic Network (SDN). The SDNs were created to process data which varies with...
Lewis Eric Hibell, Honghai Liu, David J. Brown
146
Voted
SIGIR
2011
ACM
14 years 5 months ago
Inverted indexes for phrases and strings
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...
KBSE
2002
IEEE
15 years 7 months ago
Generating Test Data for Functions with Pointer Inputs
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
Srinivas Visvanathan, Neelam Gupta
93
Voted
WWW
2003
ACM
16 years 3 months ago
Data-Sharing Relationships in the Web
We propose a novel structure, the data-sharing graph, for characterizing sharing patterns in large-scale data distribution systems. We analyze this structure in two such systems a...
Adriana Iamnitchi, Matei Ripeanu, Ian T. Foster