Sciweavers

4103 search results - page 438 / 821
» Some results on the Collatz problem
Sort
View
ICIAP
2005
ACM
16 years 8 days ago
Robust Particle Filtering for Object Tracking
Abstract. This paper addresses the filtering problem when no assumption about linearity or gaussianity is made on the involved density functions. This approach, widely known as pa...
Daniel Rowe, Ignasi Rius, Jordi Gonzàlez, J...
157
Voted
IJCNLP
2005
Springer
16 years 8 days ago
A New Method for Sentiment Classification in Text Retrieval
Traditional text categorization is usually a topic-based task, but a subtle demand on information retrieval is to distinguish between positive and negative view on text topic. In t...
Yi Hu, Jianyong Duan, Xiaoming Chen, Bingzhen Pei,...
MICAI
2005
Springer
16 years 8 days ago
Coordination Through Plan Repair
In most practical situations, agents need to continuously improve or repair their plans. In a multiagent system agents also need to coordinate their plans. Consequently, we need me...
Roman van der Krogt, Mathijs de Weerdt
PAKDD
2005
ACM
180views Data Mining» more  PAKDD 2005»
16 years 8 days ago
Conditional Random Fields for Transmembrane Helix Prediction
Abstract. It is estimated that 20% of genes in the human genome encode for integral membrane proteins (IMPs) and some estimates are much higher. IMPs control a broad range of event...
Lior Lukov, Sanjay Chawla, W. Bret Church
WG
2005
Springer
16 years 7 days ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...