Sciweavers

514 search results - page 39 / 103
» Multiplicative structures in additively large sets
Sort
View
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
CADE
2009
Springer
14 years 8 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
FC
2005
Springer
87views Cryptology» more  FC 2005»
14 years 1 months ago
Protecting Secret Data from Insider Attacks
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
David Dagon, Wenke Lee, Richard J. Lipton
IFIP12
2010
13 years 5 months ago
Information Fusion for Entity Matching in Unstructured Data
Every day the global media system produces an abundance of news stories, all containing many references to people. An important task is to automatically generate reliable lists of ...
Omar Ali, Nello Cristianini
MMM
2008
Springer
158views Multimedia» more  MMM 2008»
14 years 2 months ago
Similarity Search in Multimedia Time Series Data Using Amplitude-Level Features
Effective similarity search in multi-media time series such as video or audio sequences is important for content-based multi-media retrieval applications. We propose a framework th...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...