Sciweavers

28 search results - page 3 / 6
» An Exponential Model for Infinite Rankings
Sort
View
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
14 years 7 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
STACS
1998
Springer
13 years 11 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John
ICML
2005
IEEE
14 years 8 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
QEST
2010
IEEE
13 years 5 months ago
Canonical Form Based MAP(2) Fitting
The importance of the order two Markovian arrival process (MAP(2)) comes from its compactness, serving either as arrival or service process in applications, and from the nice prope...
Levente Bodrog, Peter Buchholz, Jan Kriege, Mikl&o...