Sciweavers

1816 search results - page 182 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
AAAI
1994
15 years 7 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
CORR
2012
Springer
230views Education» more  CORR 2012»
14 years 2 months ago
RT-SLAM: A Generic and Real-Time Visual SLAM Implementation
Abstract. This article presents a new open-source C++ implementation to solve the SLAM problem, which is focused on genericity, versatility and high execution speed. It is based on...
Cyril Roussillon, Aurélien Gonzalez, Joan S...
SDM
2009
SIAM
202views Data Mining» more  SDM 2009»
16 years 3 months ago
Proximity-Based Anomaly Detection Using Sparse Structure Learning.
We consider the task of performing anomaly detection in highly noisy multivariate data. In many applications involving real-valued time-series data, such as physical sensor data a...
Tsuyoshi Idé, Aurelie C. Lozano, Naoki Abe,...
SPEECH
2010
154views more  SPEECH 2010»
15 years 1 months ago
Long story short - Global unsupervised models for keyphrase based meeting summarization
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
Korbinian Riedhammer, Benoît Favre, Dilek Ha...