Sciweavers

4415 search results - page 420 / 883
» How to Pair with a Human
Sort
View
SSD
2001
Springer
103views Database» more  SSD 2001»
15 years 11 months ago
Similarity of Cardinal Directions
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
Roop K. Goyal, Max J. Egenhofer
STACS
2001
Springer
15 years 11 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
ICS
1999
Tsinghua U.
15 years 11 months ago
Reorganizing global schedules for register allocation
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...
Gang Chen, Michael D. Smith
INFOCOM
1998
IEEE
15 years 11 months ago
On Statistical Multiplexing, Traffic Mixes, and VP Management
ATM-based integrated services networks are likely to rely on the Virtaal Path (VP) concept as an intermediate resource management layer wherein key decisions concerning resource a...
Ching-Fong Su, Gustavo de Veciana
SIGIR
1998
ACM
15 years 11 months ago
Boosting and Rocchio Applied to Text Filtering
We discuss two learning algorithms for text filtering: modified Rocchio and a boosting algorithm called AdaBoost. We show how both algorithms can be adapted to maximize any gene...
Robert E. Schapire, Yoram Singer, Amit Singhal