Sciweavers

2397 search results - page 136 / 480
» Applications of integer relation algorithms
Sort
View
WG
2009
Springer
16 years 1 months ago
Chordal Digraphs
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
Daniel Meister, Jan Arne Telle
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 3 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
CVPR
2008
IEEE
16 years 8 months ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...
ICALP
2005
Springer
15 years 12 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos