Sciweavers

1243 search results - page 45 / 249
» Generating Trees on Multisets
Sort
View
IJCAI
2003
13 years 11 months ago
Expressive Power of Tree and String Based Wrappers
There exist two types of wrappers: the string based wrapper such as the LR wrapper, and the tree based wrapper. A tree based wrapper designates extraction regions by nodes on the ...
Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 9 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
ACTA
2008
88views more  ACTA 2008»
13 years 8 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
NAACL
2010
13 years 7 months ago
Dialogue-Oriented Review Summary Generation for Spoken Dialogue Recommendation Systems
In this paper we present an opinion summarization technique in spoken dialogue systems. Opinion mining has been well studied for years, but very few have considered its applicatio...
Jingjing Liu, Stephanie Seneff, Victor Zue
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
14 years 1 months ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein