Sciweavers

368 search results - page 56 / 74
» Probabilistic base calling of Solexa sequencing data
Sort
View
ACL
2012
11 years 10 months ago
Automatic Event Extraction with Structured Preference Modeling
This paper presents a novel sequence labeling model based on the latent-variable semiMarkov conditional random fields for jointly extracting argument roles of events from texts. ...
Wei Lu, Dan Roth
CHI
2009
ACM
14 years 8 months ago
Using temporal patterns (t-patterns) to derive stress factors of routine tasks
We describe the use of a statistical technique called Tpattern analysis to derive and characterize the routineness of tasks. T-patterns provide significant advantages over traditi...
Oliver Brdiczka, Norman Makoto Su, Bo Begole
SIGIR
2005
ACM
14 years 1 months ago
Generic soft pattern models for definitional question answering
This paper explores probabilistic lexico-syntactic pattern matching, also known as soft pattern matching. While previous methods in soft pattern matching are ad hoc in computing t...
Hang Cui, Min-Yen Kan, Tat-Seng Chua
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
13 years 9 months ago
On community outliers and their efficient detection in information networks
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...
Jing Gao, Feng Liang, Wei Fan, Chi Wang, Yizhou Su...
CIKM
1997
Springer
13 years 12 months ago
A Framework for the Management of Past Experiences with Time-Extended Situations
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
Michel Jaczynski