Sciweavers

32 search results - page 6 / 7
» The expansion and mixing time of skip graphs with applicatio...
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
14 years 2 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
SIAMDM
2008
77views more  SIAMDM 2008»
13 years 7 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...
CI
2011
110views more  CI 2011»
13 years 2 months ago
Experiences with planning for natural language generation
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
Alexander Koller, Ronald P. A. Petrick