32545 search results - page 384 / 6509 » Data Structures and Algorithms |
124
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
276
click to vote
VLDB
2009
ACM
16 years 7 months ago
2009
ACM
Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broad...
177
click to vote
COLCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
187
click to vote
DEXA
2005
Springer
16 years 11 days ago
2005
Springer
Current proposals for XML change detection use structural constraints to detect the changes and they ignore semantic constraints. Consequently, they may produce semantically incorr...
169
click to vote
VVS
1996
IEEE
15 years 11 months ago
1996
IEEE
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...