Sciweavers

702 search results - page 68 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 1 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
BMCBI
2006
156views more  BMCBI 2006»
14 years 12 months ago
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models
Background: Horizontal gene transfer (HGT) is considered a strong evolutionary force shaping the content of microbial genomes in a substantial manner. It is the difference in spee...
Stephan Waack, Oliver Keller, Roman Asper, Thomas ...
FSTTCS
2010
Springer
14 years 9 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
TVCG
2012
185views Hardware» more  TVCG 2012»
13 years 2 months ago
Interest Driven Navigation in Visualization
—This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that a...
Christopher G. Healey, Brent M. Dennis
ICMCS
2005
IEEE
107views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Evaluating keypoint methods for content-based copyright protection of digital images
This paper evaluates the effectiveness of keypoint methods for content-based protection of digital images. These methods identify a set of “distinctive” regions (termed keypoi...
Larry Huston, Rahul Sukthankar, Yan Ke