Sciweavers

1053 search results - page 8 / 211
» On k-Path Covers and their applications
Sort
View
ESOP
2008
Springer
13 years 10 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 9 months ago
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
13 years 8 months ago
Weighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
Iwao Sato
ICASSP
2011
IEEE
13 years 16 days ago
An interference-free representation of instantaneous frequency of periodic signals and its application to F0 extraction
An interference-free representation of the instantaneous frequency of constituent harmonic components of periodic signals is introduced. The power weighted average instantaneous f...
Hideki Kawahara, Toshio Irino, Masanori Morise
EKAW
2006
Springer
14 years 14 days ago
Ontology Selection for the Real Semantic Web: How to Cover the Queen's Birthday Dinner?
Robust mechanisms for ontology selection are crucial for the evolving Semantic Web characterized by rapidly increasing numbers of online ontologies and by applications that automat...
Marta Sabou, Vanessa Lopez, Enrico Motta