Sciweavers

CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 9 months ago
Compact Floor-Planning via Orderly Spanning Trees
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for a...
Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 9 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
CORR
2002
Springer
90views Education» more  CORR 2002»
13 years 9 months ago
Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences
Given the lack of word delimiters in written Japanese, word segmentation is generally considered a crucial first step in processing Japanese texts. Typical Japanese segmentation a...
Rie Kubota Ando, Lillian Lee
CORR
2002
Springer
118views Education» more  CORR 2002»
13 years 9 months ago
Unsupervised discovery of morphologically related words based on orthographic and semantic similarity
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to di...
Marco Baroni, Johannes Matiasek, Harald Trost
ECCC
2000
81views more  ECCC 2000»
13 years 9 months ago
A Linear Space Algorithm for Computing the Hermite Normal Form
Computing the Hermite Normal Form of an n
Daniele Micciancio, Bogdan Warinschi
ECCC
2000
117views more  ECCC 2000»
13 years 9 months ago
On Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Oded Goldreich, Dana Ron
DAM
2000
126views more  DAM 2000»
13 years 9 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 9 months ago
The Role of Commutativity in Constraint Propagation Algorithms
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
Krzysztof R. Apt
COLING
2002
13 years 9 months ago
Unsupervised Learning of Generalized Names
We present an algorithm, Nomen, for learning generalized names in text. Examples of these are names of diseases and infectious agents, such as bacteria and viruses. These names ex...
Roman Yangarber, Winston Lin, Ralph Grishman
CN
2002
88views more  CN 2002»
13 years 9 months ago
Rate allocation and buffer management for differentiated services
A novel algorithm for buffer management and rate allocation is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, calle...
Jörg Liebeherr, Nicolas Christin