Sciweavers

3757 search results - page 585 / 752
» The overlap number of a graph
Sort
View
IEICET
2010
92views more  IEICET 2010»
15 years 5 months ago
Spectral Methods for Thesaurus Construction
Traditionally, popular synonym acquisition methods are based on the distributional hypothesis, and a metric such as Jaccard coefficients is used to evaluate the similarity between...
Nobuyuki Shimizu, Masashi Sugiyama, Hiroshi Nakaga...
JCS
2010
124views more  JCS 2010»
15 years 4 months ago
Verifying resource access control on mobile interactive devices
A model of resource access control is presented in which the access control to resources can employ user interaction to obtain the necessary permissions. This model is inspired by...
Frédéric Besson, Guillaume Dufay, Th...
JCT
2010
87views more  JCT 2010»
15 years 4 months ago
Bijections between pattern-avoiding fillings of Young diagrams
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
Matthieu Josuat-Vergès
MOR
2010
111views more  MOR 2010»
15 years 4 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
SIAMDM
2010
84views more  SIAMDM 2010»
15 years 4 months ago
On Computing the Frequencies of Induced Subhypergraphs
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
Brendan Nagle