Sciweavers

313 search results - page 61 / 63
» Redundancy Elimination for LF
Sort
View
SBBD
2004
119views Database» more  SBBD 2004»
13 years 7 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ACL
1998
13 years 7 months ago
Compacting the Penn Treebank Grammar
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
Alexander Krotov, Mark Hepple, Robert J. Gaizauska...
AAAI
1996
13 years 7 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
BMCBI
2007
112views more  BMCBI 2007»
13 years 6 months ago
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
Background: Gene expression microarray is a powerful technology for genetic profiling diseases and their associated treatments. Such a process involves a key step of biomarker ide...
Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipou...
JCIT
2008
138views more  JCIT 2008»
13 years 6 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan