Sciweavers

1816 search results - page 184 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
ISBRA
2009
Springer
16 years 1 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
WSC
2008
15 years 8 months ago
Knowledge-based event control for flow-shops using simulation and rules
The requirements on production systems and their planning and control systems are constantly growing. Systems have to be flexible and provide viable solutions at the same time. Di...
Mark Aufenanger, Wilhelm Dangelmaier, Christoph La...
CIE
2007
Springer
16 years 21 days ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
ASPDAC
1999
ACM
117views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Analysing Forced Oscillators with Multiple Time Scales
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...
Onuttom Narayan, Jaijeet S. Roychowdhury