Sciweavers

1142 search results - page 83 / 229
» Some Applications of Interval Analysis to Statistical Proble...
Sort
View
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 8 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
PADL
2000
Springer
15 years 6 months ago
Calculating a New Data Mining Algorithm for Market Basket Analysis
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
Zhenjiang Hu, Wei-Ngan Chin, Masato Takeichi
AAAI
2008
15 years 5 months ago
A Variance Analysis for POMDP Policy Evaluation
Partially Observable Markov Decision Processes have been studied widely as a model for decision making under uncertainty, and a number of methods have been developed to find the s...
Mahdi Milani Fard, Joelle Pineau, Peng Sun
TACAS
2007
Springer
125views Algorithms» more  TACAS 2007»
15 years 9 months ago
Type-Dependence Analysis and Program Transformation for Symbolic Execution
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
Saswat Anand, Alessandro Orso, Mary Jean Harrold
FUIN
2010
143views more  FUIN 2010»
15 years 17 days ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer