Sciweavers

5329 search results - page 296 / 1066
» The Weighted Majority Algorithm
Sort
View
DAM
2007
100views more  DAM 2007»
15 years 6 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
VTC
2006
IEEE
114views Communications» more  VTC 2006»
16 years 19 days ago
A Scheduling Scheme under a Ratio Constraint for the Multiuser MIMO Systems
A scheduling scheme for MIMO systems which has the capability of obtaining multiuser diversity gain and controlling the link connection ratio among users simultaneously is proposed...
Jiwon Kang, Hakju Lee, Chungyong Lee, Young Yong K...
TAL
2004
Springer
15 years 12 months ago
One Size Fits All? A Simple Technique to Perform Several NLP Tasks
Word fragments or n-grams have been widely used to perform different Natural Language Processing tasks such as information retrieval [1] [2], document categorization [3], automatic...
Daniel Gayo-Avello, Darío Álvarez Gu...
SIGIR
2002
ACM
15 years 6 months ago
Analysis of papers from twenty-five years of SIGIR conferences: what have we been doing for the last quarter of a century?
mes, abstracts and year of publication of all 853 papers published.1 We then applied Porter stemming and stopword removal to this text, represented terms from the elds with twice t...
Alan F. Smeaton, Gary Keogh, Cathal Gurrin, Kieran...
146
Voted
COMPGEOM
1995
ACM
15 years 10 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III