Sciweavers

11394 search results - page 247 / 2279
» Error-Correcting Data Structures
Sort
View
155
Voted
BMCBI
2008
204views more  BMCBI 2008»
15 years 3 months ago
EST2uni: an open, parallel tool for automated EST analysis and database creation, with a data mining web interface and microarra
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
Javier Forment, Francisco Gilabert Villamón...
121
Voted
TLCA
2009
Springer
15 years 10 months ago
Initial Algebra Semantics for Cyclic Sharing Structures
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
Makoto Hamana
119
Voted
ICML
2004
IEEE
16 years 4 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
155
Voted
CCR
2004
89views more  CCR 2004»
15 years 3 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron
130
Voted
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
15 years 10 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr