Sciweavers

530 search results - page 35 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
13 years 11 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki
FOCS
2008
IEEE
14 years 2 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
IPPS
2002
IEEE
14 years 23 days ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
AAAI
2006
13 years 9 months ago
Contingent Planning with Goal Preferences
The importance of the problems of contingent planning with actions that have non-deterministic effects and of planning with goal preferences has been widely recognized, and severa...
Dmitry Shaparau, Marco Pistore, Paolo Traverso