Sciweavers

1284 search results - page 207 / 257
» Data Structures for Mergeable Trees
Sort
View
BMCBI
2010
160views more  BMCBI 2010»
14 years 5 months ago
eHive: An Artificial Intelligence workflow system for genomic analysis
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
Jessica Severin, Kathryn Beal, Albert J. Vilella, ...
ICDE
2007
IEEE
163views Database» more  ICDE 2007»
15 years 11 months ago
Adding Context to Preferences
To handle the overwhelming amount of information currently available, personalization systems allow users to specify the information that interests them through preferences. Most ...
Kostas Stefanidis, Evaggelia Pitoura, Panos Vassil...
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
15 years 11 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
DCC
2008
IEEE
15 years 9 months ago
On Self-Indexing Images - Image Compression with Added Value
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
Veli Mäkinen, Gonzalo Navarro
DCC
2007
IEEE
15 years 9 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...