Sciweavers

118 search results - page 22 / 24
» Ordinal computations
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 1 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
WWW
2009
ACM
14 years 8 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel
BIRTHDAY
2003
Springer
14 years 26 days ago
Eine neue Methode zur Visualisierung qualitativer Daten
Abstract: Zur Visualisierung multivariater Daten mit verschiedenen Informationsniveaus (metrisch, nominal, ordinal, hierachisch, verbandsgeordnet, etc.) wird h¨aufig die klassisc...
Jürgen Hansohm
CVPR
2010
IEEE
13 years 7 months ago
Total Bregman divergence and its applications to shape retrieval
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...
Meizhu Liu, Baba C. Vemuri, Shun-ichi Amari, Frank...
ICALP
2009
Springer
14 years 8 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro