11231 search results - page 305 / 2247 » Digging for Data Structures |
145
click to vote
ICMCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Most of the existing work on modeling variable bit rate (VBR) video sources does not either explicitly take into account groupof-pictures (GOP) or assumes a fixed GOP structure. R...
151
click to vote
APPML
2002
15 years 6 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
154
click to vote
TACAS
2007
Springer
16 years 24 days ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
150
click to vote
JCDCG
2004
Springer
16 years 1 days ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
171
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
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...