Sciweavers

32545 search results - page 139 / 6509
» Data Structures and Algorithms
Sort
View
ESA
2008
Springer
73views Algorithms» more  ESA 2008»
15 years 4 months ago
On the Size of the 3D Visibility Skeleton: Experimental Results
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Chri...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 13 days ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 9 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
APVIS
2007
15 years 4 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
116
Voted
IAJIT
2008
123views more  IAJIT 2008»
15 years 3 months ago
Vectorial Information Structuring for Documents Filtering and Diffusion
: Information retrieval tries to identify relevant documents for an information need. The problems that an IR system should deal with include document indexing (which tries to extr...
Omar Nouali, Abdelghani Krinah