Sciweavers

11214 search results - page 15 / 2243
» Just-in-time data structures
Sort
View
ASIACRYPT
2010
Springer
13 years 7 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
COLING
2010
13 years 4 months ago
Self-Annotation for fine-grained geospatial relation extraction
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...
André Blessing, Hinrich Schütze
MVA
2010
130views Computer Vision» more  MVA 2010»
13 years 8 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 8 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 10 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar