Sciweavers

702 search results - page 124 / 141
» Learning Probabilistic Models of Relational Structure
Sort
View
IPL
2010
98views more  IPL 2010»
13 years 6 months ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller
ICML
2010
IEEE
13 years 8 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
SIGIR
2010
ACM
13 years 11 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
ISI
2003
Springer
14 years 20 days ago
Authorship Analysis in Cybercrime Investigation
Criminals have been using the Internet to distribute a wide range of illegal materials globally in an anonymous manner, making criminal identity tracing difficult in the cybercrime...
Rong Zheng, Yi Qin, Zan Huang, Hsinchun Chen
VLSISP
1998
111views more  VLSISP 1998»
13 years 7 months ago
Quantitative Analysis of MR Brain Image Sequences by Adaptive Self-Organizing Finite Mixtures
This paper presents an adaptive structure self-organizing finite mixture network for quantification of magnetic resonance (MR) brain image sequences. We present justification fo...
Yue Wang, Tülay Adali, Chi-Ming Lau, Sun-Yuan...