Sciweavers

2889 search results - page 496 / 578
» Querying Structured Hyperdocuments
Sort
View
DAC
2006
ACM
14 years 9 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
WWW
2005
ACM
14 years 8 months ago
Association search in semantic web: search + inference
Association search is to search for certain instances in semantic web and then make inferences from and about the instances we have found. In this paper, we propose the problem of...
Bangyong Liang, Jie Tang, Juan-Zi Li
WWW
2002
ACM
14 years 8 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»
14 years 8 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
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 8 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...