Sciweavers

369 search results - page 28 / 74
» Fast Algorithms for the Generalized Foley-Sammon Discriminan...
Sort
View
ICFP
2005
ACM
14 years 1 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
14 years 25 days ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
ICPR
2008
IEEE
14 years 8 months ago
Feature selection focused within error clusters
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
Henry S. Baird, Sui-Yu Wang
MM
2010
ACM
198views Multimedia» more  MM 2010»
13 years 7 months ago
Analyzing and predicting sentiment of images on the social web
In this paper we study the connection between sentiment of images expressed in metadata and their visual content in the social photo sharing environment Flickr. To this end, we co...
Stefan Siersdorfer, Enrico Minack, Fan Deng, Jonat...
SIGIR
2004
ACM
14 years 29 days ago
Locality preserving indexing for document representation
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma