Sciweavers

484 search results - page 54 / 97
» Computing Hilbert Class Polynomials
Sort
View
IPL
2002
90views more  IPL 2002»
13 years 8 months ago
Recognition and dualization of disguised bidual Horn functions
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
13 years 9 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
JSYML
2010
107views more  JSYML 2010»
13 years 7 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
GD
2005
Springer
14 years 2 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
FGR
2002
IEEE
189views Biometrics» more  FGR 2002»
14 years 1 months ago
Clustering Contextual Facial Display Sequences
We describe a method for learning classes of facial motion patterns from video of a human interacting with a computerized embodied agent. The method also learns correlations betwe...
Jesse Hoey