Sciweavers

520 search results - page 52 / 104
» Subset Counting in Trees
Sort
View
ESOP
2007
Springer
14 years 2 months ago
Modular Shape Analysis for Dynamically Encapsulated Programs
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard ...
Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Rama...
IPPS
2006
IEEE
14 years 1 months ago
An overview of the Jahob analysis system: project goals and current status
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
Viktor Kuncak, Martin C. Rinard
UAI
2004
13 years 9 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
PR
2008
93views more  PR 2008»
13 years 7 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 9 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta