Sciweavers

1322 search results - page 57 / 265
» Parameterized counting problems
Sort
View
JCT
2007
90views more  JCT 2007»
13 years 8 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
KDD
1997
ACM
78views Data Mining» more  KDD 1997»
14 years 29 days ago
Mining Generalized Term Associations: Count Propagation Algorithm
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...
Jonghyun Kahng, Wen-Hsiang Kevin Liao, Dennis McLe...
CASES
2006
ACM
14 years 2 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
AAAI
2007
13 years 11 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
ICPR
2004
IEEE
14 years 10 months ago
Building and Registering Parameterized 3D Models of Vessel Trees for Visualization during Intervention
In this paper we address the problem of multimodal registration of coronary vessels by developing a 3D parametrical model of vessel trees from computer tomography data and registe...
Georg Langs, Petia Radeva, David Rotger, Francesc ...