1145 search results - page 172 / 229 » Discrete Green's Functions |
190
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
177
click to vote
ICCAD
1997
IEEE
15 years 9 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
164
click to vote
COMPGEOM
1987
ACM
15 years 9 months ago
1987
ACM
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
156
Voted
NIPS
2007
15 years 7 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
156
click to vote
AI
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...