Sciweavers

4277 search results - page 628 / 856
» On Multiple Linear Approximations
Sort
View
STRINGOLOGY
2004
15 years 7 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
BROADBAND
1998
15 years 7 months ago
Traffic management in an ATM multi-service switch for workgroups
ATM switches have to provide traffic management functions to meet the QoS requirements of different service categories. Among the traffic management functions we will focus on con...
Stefan Bodamer, Thomas Renger, Georg Röß...
COLING
2000
15 years 7 months ago
A Method of Measuring Term Representativeness - Baseline Method Using Co-occurrence Distribution
This paper introduces a scheme, which we call the baseline method, to define a measure of term representativeness and measures defined by using the scheme. The representativeness ...
Toru Hisamitsu, Yoshiki Niwa, Jun-ichi Tsujii
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 7 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
NIPS
1997
15 years 7 months ago
Learning to Order Things
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer