Sciweavers

350 search results - page 39 / 70
» Branching Programs for Tree Evaluation
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
JILP
2000
165views more  JILP 2000»
13 years 7 months ago
BMAT - A Binary Matching Tool for Stale Profile Propagation
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
Zheng Wang, Ken Pierce, Scott McFarling
IIWAS
2007
13 years 9 months ago
An Extensible Framework for Database Security Assessment and Visualization
By using database security metrics to evaluate how risky the current database environment is and visually displaying the metric results on graphs, database security visualization ...
Tran Khanh Dang, Thieu Hoa Le, Duy Tin Truong
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
KCAP
2003
ACM
14 years 25 days ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld