Sciweavers

3614 search results - page 677 / 723
» Numerical Computing with MATLAB
Sort
View
KDD
2002
ACM
293views Data Mining» more  KDD 2002»
16 years 1 months ago
Automatic Categorization of Web Pages and User Clustering with Mixtures of Hidden Markov Models
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
Alexander Ypma, Tom Heskes
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 1 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 1 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 1 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 1 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...