Sciweavers

6833 search results - page 1329 / 1367
» Some two-character sets
Sort
View
DATAMINE
2006
176views more  DATAMINE 2006»
14 years 9 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
DATAMINE
2006
89views more  DATAMINE 2006»
14 years 9 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
ECCC
2006
120views more  ECCC 2006»
14 years 9 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ENTCS
2006
115views more  ENTCS 2006»
14 years 9 months ago
Analyzing the Uses of a Software Modeling Tool
While a lot of progress has been made in improving analyses and tools that aid software development, less effort has been spent on studying how such tools are commonly used in pra...
Xiaoming Li, Daryl Shannon, Jabari Walker, Sarfraz...
BMCBI
2007
164views more  BMCBI 2007»
14 years 9 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
« Prev « First page 1329 / 1367 Last » Next »