Sciweavers

606 search results - page 59 / 122
» words 2002
Sort
View
CORR
2002
Springer
86views Education» more  CORR 2002»
13 years 9 months ago
Small Strictly Convex Quadrilateral Meshes of Point Sets
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 9 months ago
The Basque task: did systems perform in the upperbound?
In this paper we describe the Senseval 2 Basque lexicalsample task. The task comprised 40 words (15 nouns, 15 verbs and 10 adjectives) selected from Euskal Hiztegia...
Eneko Agirre, Elena Garcia, Mikel Lersundi, David ...
CPC
2002
80views more  CPC 2002»
13 years 9 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
DAM
2002
135views more  DAM 2002»
13 years 9 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
DM
2002
84views more  DM 2002»
13 years 9 months ago
On incidence coloring for some cubic graphs
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen