Sciweavers

720 search results - page 98 / 144
» A Weighting Scheme for Star-Graphs
Sort
View
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 4 months ago
Approximation of Partial Capacitated Vertex Cover
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...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
CHI
1993
ACM
14 years 2 months ago
Exploring the applications of user-expertise assessment for intelligent interfaces
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...
Michel Desmarais, Jiming Liu
JUCS
2008
130views more  JUCS 2008»
13 years 10 months ago
Feature Selection for the Classification of Large Document Collections
: 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...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
BMCBI
2005
152views more  BMCBI 2005»
13 years 9 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
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...
Markus Wistrand, Erik L. L. Sonnhammer
IOR
2010
161views more  IOR 2010»
13 years 8 months ago
Mechanism Design for Decentralized Online Machine Scheduling
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...
Birgit Heydenreich, Rudolf Müller, Marc Uetz