827 search results - page 148 / 166 » The Complexity of Probabilistic Lobbying |
115
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
130
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Domains are the basic functional units of proteins. It is believed that protein-protein interactions are realized through domain interactions. Revealing multi-domain c...
126
click to vote
ENTCS
2008
15 years 1 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
117
click to vote
JFR
2006
15 years 1 months ago
2006
In mobile robotics, there are often features that, while potentially powerful for improving navigation, prove difficult to profit from as they generalize poorly to novel situations...
123
click to vote
PAMI
2006
15 years 1 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...