Sciweavers

685 search results - page 38 / 137
» Succinct Trees in Practice
Sort
View
AAAI
1996
13 years 9 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
DRMTICS
2005
Springer
14 years 1 months ago
Call Tree Transformation for Program Obfuscation and Copy Protection
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
Valery Pryamikov
CEC
2003
IEEE
13 years 11 months ago
Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
Clare Bates Congdon, Kevin J. Septor
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 6 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ICCSA
2007
Springer
14 years 1 months ago
Tracing Illegal Users of Video: Reconsideration of Tree-Specific and Endbuyer-Specific Methods
In our recent study, we have presented an approach for tracing illegal users in content distribution networks using watermarking and fingerprinting techniques [1][2]. In this paper...
Hyun-Ho Kang, Brian M. Kurkoski, Kazuhiko Yamaguch...