Sciweavers

1964 search results - page 297 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
137
Voted
CADE
2009
Springer
15 years 9 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
118
Voted
JACM
2006
99views more  JACM 2006»
15 years 2 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
149
Voted
ACRI
2010
Springer
15 years 1 months ago
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
Carolina Mejía, J. Andrés Montoya
143
Voted
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 2 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
111
Voted
VLDB
1998
ACM
136views Database» more  VLDB 1998»
15 years 6 months ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton