Sciweavers

9209 search results - page 211 / 1842
» Data Space Randomization
Sort
View
COMPGEOM
2009
ACM
16 years 23 days ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
WWW
2009
ACM
16 years 7 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
CVPR
2005
IEEE
16 years 8 months ago
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
Qiang Ji, Yang Wang 0002
PAKDD
2009
ACM
134views Data Mining» more  PAKDD 2009»
16 years 3 months ago
On Link Privacy in Randomizing Social Networks.
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
160
Voted
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 11 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...