Sciweavers

9209 search results - page 1771 / 1842
» Data Space Randomization
Sort
View
122
Voted
TKDE
1998
122views more  TKDE 1998»
15 years 2 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
PVLDB
2010
164views more  PVLDB 2010»
15 years 1 months ago
FlashStore: High Throughput Persistent Key-Value Store
We present FlashStore, a high throughput persistent keyvalue store, that uses flash memory as a non-volatile cache between RAM and hard disk. FlashStore is designed to store the ...
Biplob Debnath, Sudipta Sengupta, Jin Li
PVLDB
2010
122views more  PVLDB 2010»
15 years 1 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
MM
2010
ACM
271views Multimedia» more  MM 2010»
15 years 1 months ago
Large-scale music tag recommendation with explicit multiple attributes
Social tagging can provide rich semantic information for largescale retrieval in music discovery. Such collaborative intelligence, however, also generates a high degree of tags un...
Zhendong Zhao, Xinxi Wang, Qiaoliang Xiang, Andy M...
SADFE
2010
IEEE
15 years 1 months ago
Fonts for Forensics
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
Fred Cohen
« Prev « First page 1771 / 1842 Last » Next »