Sciweavers

901 search results - page 107 / 181
» On Anonymization of String Data
Sort
View
ACSC
2009
IEEE
15 years 8 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
NLPRS
2001
Springer
15 years 6 months ago
A Hierarchical EM Approach to Word Segmentation
We propose a simple two-level hierarchical probability model for unsupervised word segmentation. By treating words as strings composed of morphemes/phonemes which are themselves c...
Fuchun Peng, Dale Schuurmans
JMIV
2006
130views more  JMIV 2006»
15 years 1 months ago
Alternative 2D Shape Representations using the Symmetry Set
Among the many attempts made to represent families of 2D shapes in a simpler way, the Medial Axis (MA) takes a prominent place. Its graphical representation is intuitively appealin...
Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Ma...
JMLR
2010
111views more  JMLR 2010»
14 years 8 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
14 years 4 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel