Sciweavers

9209 search results - page 247 / 1842
» Data Space Randomization
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 1 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
CIKM
2009
Springer
15 years 11 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
COMPGEOM
2008
ACM
15 years 8 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
ICCV
2007
IEEE
16 years 8 months ago
Steerable Random Fields
In contrast to traditional Markov random field (MRF) models, we develop a Steerable Random Field (SRF) in which the field potentials are defined in terms of filter responses that ...
Stefan Roth, Michael J. Black
FPGA
2004
ACM
234views FPGA» more  FPGA 2004»
15 years 10 months ago
An embedded true random number generator for FPGAs
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
Paul Kohlbrenner, Kris Gaj