1322 search results - page 189 / 265 » Parameterized counting problems |
135
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
115
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
149
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
122
Voted
CORR
2000
Springer
15 years 3 months ago
2000
Springer
Analyzing the effect of concentrated noise on a typical decision-making process of a simplified two-candidate voting model, we have demonstrated that a local approach using a regi...
137
Voted
TCS
1998
15 years 3 months ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...