Sciweavers

3055 search results - page 133 / 611
» Randomized Search Trees
Sort
View
ACL
2008
14 years 3 days ago
A Generic Sentence Trimmer with CRFs
The paper presents a novel sentence trimmer in Japanese, which combines a non-statistical yet generic tree generation model and Conditional Random Fields (CRFs), to address improv...
Tadashi Nomoto
GLOBECOM
2007
IEEE
14 years 5 months ago
Centralized Scheduling Tree Construction Under Multi-Channel IEEE 802.16 Mesh Networks
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
Wenhua Jiao, Pin Jiang, Ruoju Liu, Ming Li
EOR
2008
107views more  EOR 2008»
13 years 10 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
TCS
2010
13 years 9 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
SOFSEM
2007
Springer
14 years 4 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...