195 search results - page 27 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
142
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
182
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
165
Voted
WINE
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
169
click to vote
SODA
2004
ACM
15 years 7 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...
142
click to vote
GLOBECOM
2008
IEEE
16 years 16 days ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...