720 search results - page 98 / 144 » A Weighting Scheme for Star-Graphs |
125
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
103
Voted
CHI
1993
ACM
15 years 4 months ago
1993
ACM
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...
103
Voted
JUCS
2008
15 years 19 days ago
2008
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
117
Voted
BMCBI
2005
15 years 17 days ago
2005
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
125
click to vote
IOR
2010
14 years 11 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...