Sciweavers

1629 search results - page 289 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CCS
2010
ACM
15 years 1 months ago
Towards publishing recommendation data with predictive anonymization
Recommender systems are used to predict user preferences for products or services. In order to seek better prediction techniques, data owners of recommender systems such as Netfli...
Chih-Cheng Chang, Brian Thompson, Hui (Wendy) Wang...
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 9 months ago
Modeling the structure and evolution of discussion cascades
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
Vicenç Gómez, Hilbert J. Kappen, And...
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
AAMAS
2002
Springer
14 years 9 months ago
A Scheduling Scheme for Controlling Allocation of CPU Resources for Mobile Programs
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support eff...
Manoj Lal, Raju Pandey
ACL
2010
14 years 7 months ago
Structural Semantic Relatedness: A Knowledge-Based Method to Named Entity Disambiguation
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
Xianpei Han, Jun Zhao