CORR
2000
Springer
13 years 9 months ago
2000
Springer
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments on a set of 15 selected polys...
CN
2002
13 years 9 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
CLUSTER
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we address the impact of resource limitations on the operation and performance of the broadcasting and multicasting schemes developed for infrastructureless wireless...
COMGEO
2000
ACM
13 years 9 months ago
2000
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
CCR
2002
13 years 9 months ago
2002
Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection...
BMCBI
2002
13 years 9 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
BMCBI
2002
13 years 9 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
ALGORITHMICA
2000
13 years 9 months ago
2000
Localization is the process of determining the robot's location within its environment. More precisely, it is a procedure which takes as input a geometric map, a current estim...
ALGORITHMICA
2000
13 years 9 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
AAECC
2000
Springer
13 years 9 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...