Sciweavers

5022 search results - page 939 / 1005
» Data structures and problem solving using Java
Sort
View
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
11 years 10 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
CONEXT
2006
ACM
14 years 1 months ago
Migrating home agents towards internet-scale mobility deployments
While the IETF standardization process of the Mobile IPv6 and Network Mobility (NEMO) protocols is almost complete, their large-scale deployment is not yet possible. With these te...
Ryuji Wakikawa, Guillaume Valadon, Jun Murai
WWW
2010
ACM
14 years 2 days ago
Access: news and blog analysis for the social sciences
The social sciences strive to understand the political, social, and cultural world around us, but have been impaired by limited access to the quantitative data sources enjoyed by ...
Mikhail Bautin, Charles B. Ward, Akshay Patil, Ste...
ASIACRYPT
2006
Springer
13 years 11 months ago
Secure Sketch for Biometric Templates
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
Qiming Li, Yagiz Sutcu, Nasir D. Memon
JCP
2006
139views more  JCP 2006»
13 years 7 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana