Sciweavers

16430 search results - page 142 / 3286
» On Computable Tree Functions
Sort
View
RECOMB
2009
Springer
16 years 4 months ago
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
Cedric Chauve, Nadia El-Mabrouk
142
Voted
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 7 months ago
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
Jonathan J. Hoch, Adi Shamir
164
Voted
PEPM
2011
ACM
14 years 6 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
COMPSAC
2002
IEEE
15 years 8 months ago
Evaluating Software Maintenance Cost Using Functional Redundancy Metrics
a Abstract— Source code copying for reuse (code cloning) is often observed in software implementations. Such code cloning causes difficulty when software functionalities are mod...
Takeo Imai, Yoshio Kataoka, Tetsuji Fukaya
153
Voted
TOC
2010
142views Management» more  TOC 2010»
14 years 10 months ago
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
Homin K. Lee