Sciweavers

3146 search results - page 25 / 630
» Efficient Consequence Finding
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 8 months ago
Finding nonnormal bent functions
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor...
SIGIR
2002
ACM
13 years 8 months ago
Finding relevant documents using top ranking sentences: an evaluation of two alternative schemes
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
Ryen White, Ian Ruthven, Joemon M. Jose
BMCBI
2008
208views more  BMCBI 2008»
13 years 9 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
BMCBI
2008
99views more  BMCBI 2008»
13 years 9 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 9 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan