Sciweavers

5746 search results - page 975 / 1150
» Visualizing Query Structure
Sort
View
99
Voted
WWW
2002
ACM
16 years 3 months ago
Searching with numbers
A large fraction of the useful web comprises of specification documents that largely consist of hattribute name, numeric valuei pairs embedded in text. Examples include product in...
Rakesh Agrawal, Ramakrishnan Srikant
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
16 years 2 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
126
Voted
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 2 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
82
Voted
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 2 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
131
Voted
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 2 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley