Sciweavers

520 search results - page 46 / 104
» Subset Counting in Trees
Sort
View
AUSAI
2004
Springer
14 years 1 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
PAKDD
2004
ACM
131views Data Mining» more  PAKDD 2004»
14 years 1 months ago
A Tree-Based Approach to the Discovery of Diagnostic Biomarkers for Ovarian Cancer
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
Jinyan Li, Kotagiri Ramamohanarao
DAM
2007
78views more  DAM 2007»
13 years 7 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
ASAP
2005
IEEE
182views Hardware» more  ASAP 2005»
14 years 1 months ago
A Thread and Data-Parallel MPEG-4 Video Encoder for a System-On-Chip Multiprocessor
We studied the dynamic instruction count reduction for a single-thread, vectorized and a multi-threaded, non-vectorized, MPEG-4 video encoder. Results indicate a maximum improveme...
Tom R. Jacobs, José L. Núñez-...
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
13 years 11 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar