Sciweavers

619 search results - page 63 / 124
» Generic Extensions and Generic Polynomials
Sort
View
148
Voted
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
13 years 5 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
MCSS
2007
Springer
15 years 3 months ago
Minimal symmetric Darlington synthesis
We consider the symmetric Darlington synthesis of a p × p rational symmetric Schur function S with the constraint that the extension is of size 2p×2p. Under the assumption that S...
Laurent Baratchart, P. Enqvist, A. Gombani, M. Oli...
CVPR
2009
IEEE
1666views Computer Vision» more  CVPR 2009»
16 years 11 months ago
From Contours to Regions: An Empirical Evaluation
We propose a generic grouping algorithm that constructs a hierarchy of regions from the output of any contour detector. Our method consists of two steps, an Oriented Watershed Tran...
Pablo Arbelaez, Michael Maire, Charless C. Fowlkes...
138
Voted
WWW
2004
ACM
16 years 4 months ago
VersaTutor: architecture for a constraint-based intelligent tutor generator
Intelligent tutoring systems have demonstrated their utility in a variety of domains. However, they are notoriously resource intensive to build. We report here on the development ...
Viswanathan Kodaganallur, Rob R. Weitz, David Rose...
232
Voted
ICLP
2009
Springer
16 years 4 months ago
Logic Programming for Multiagent Planning with Negotiation
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
Tran Cao Son, Enrico Pontelli, Chiaki Sakama