Sciweavers

3136 search results - page 523 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ASPDAC
2007
ACM
105views Hardware» more  ASPDAC 2007»
15 years 9 months ago
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
15 years 9 months ago
Multiobjective network design for realistic traffic models
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
Nilanjan Banerjee, Rajeev Kumar
ACCV
2006
Springer
15 years 9 months ago
Classification of Photometric Factors Based on Photometric Linearization
We propose a new method for classification of photometric factors, such as diffuse reflection, specular reflection, attached shadow, and cast shadow. For analyzing real images, we ...
Yasuhiro Mukaigawa, Yasunori Ishii, Takeshi Shakun...
156
Voted
CADE
2006
Springer
15 years 9 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
DAWAK
2006
Springer
15 years 9 months ago
Mining Direct Marketing Data by Ensembles of Weak Learners and Rough Set Methods
This paper describes problem of prediction that is based on direct marketing data coming from Nationwide Products and Services Questionnaire (NPSQ) prepared by Polish division of A...
Jerzy Blaszczynski, Krzysztof Dembczynski, Wojciec...