Sciweavers

15073 search results - page 409 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
189
Voted
TMM
2002
130views more  TMM 2002»
15 years 6 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang
180
Voted
AAAI
2006
15 years 8 months ago
Model-Based Collaborative Filtering as a Defense against Profile Injection Attacks
The open nature of collaborative recommender systems allows attackers who inject biased profile data to have a significant impact on the recommendations produced. Standard memory-...
Bamshad Mobasher, Robin D. Burke, Jeff J. Sandvig
GD
2004
Springer
16 years 7 days ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ACL
1994
15 years 8 months ago
Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
Yasuharu Den
153
Voted
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....