Sciweavers

2598 search results - page 48 / 520
» Experimental Design for Variable Selection in Data Bases
Sort
View
ECAI
2004
Springer
15 years 3 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
ICDCS
2010
IEEE
15 years 1 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang
AIEDU
2006
115views more  AIEDU 2006»
14 years 9 months ago
CycleTalk: Data Driven Design of Support for Simulation Based Learning
In this article, we discuss the motivation for a novel style of tutorial dialogue system that emphasizes reflection in a simulation based exploratory learning environment called Cy...
Carolyn Penstein Rosé, Rohit Kumar, Vincent...
NAACL
2010
14 years 7 months ago
Dependency Tree-based Sentiment Classification using CRFs with Hidden Variables
In this paper, we present a dependency treebased method for sentiment classification of Japanese and English subjective sentences using conditional random fields with hidden varia...
Tetsuji Nakagawa, Kentaro Inui, Sadao Kurohashi
BMCBI
2006
165views more  BMCBI 2006»
14 years 9 months ago
A stable gene selection in microarray data analysis
Background: Microarray data analysis is notorious for involving a huge number of genes compared to a relatively small number of samples. Gene selection is to detect the most signi...
Kun Yang, Zhipeng Cai, Jianzhong Li, Guohui Lin