Sciweavers

3122 search results - page 386 / 625
» Storing Semistructured Data with STORED
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 5 months ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
Gerth Stølting Brodal, Erik D. Demaine, Jer...
DMIN
2009
222views Data Mining» more  DMIN 2009»
15 years 4 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan
IFIPTM
2009
119views Management» more  IFIPTM 2009»
15 years 4 months ago
Detection and Prevention of Insider Threats in Database Driven Web Services
In this paper, we take the first step to address the gap between the security needs in outsourced hosting services and the protection provided in the current practice. We consider ...
Tzvi Chumash, Danfeng Yao
MIS
2011
Springer
256views Multimedia» more  MIS 2011»
15 years 1 months ago
Event sharing in vehicular networks using geographic vectors and maps
By exchanging events in a vehicular ad hoc network (VANET), drivers can receive information that allows them to find relevant places (e.g., parking spaces) or avoid dangerous/unde...
Thierry Delot, Sergio Ilarri, Nicolas Cenerario, T...
WWW
2011
ACM
15 years 1 months ago
OXPath: little language, little memory, great value
Data about everything is readily available on the web—but often only accessible through elaborate user interactions. For automated decision support, extracting that data is esse...
Andrew Jon Sellers, Tim Furche, Georg Gottlob, Gio...