Sciweavers

491 search results - page 44 / 99
» Ranking Abstractions
Sort
View
ISAAC
2003
Springer
134views Algorithms» more  ISAAC 2003»
14 years 1 months ago
New Ways to Construct Binary Search Trees
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
Travis Gagie
COCOON
1999
Springer
14 years 29 days ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
DEEC
2006
IEEE
13 years 10 months ago
Explanation Services and Request Refinement in User Friendly Semantic-Enabled B2C E-Marketplaces
Abstract. This paper presents an approach aimed at fully exploiting semantics of supply/demand descriptions in B2C and C2C e-marketplaces. Distinguishing aspects include logic-base...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
ESANN
2008
13 years 10 months ago
Rank-based quality assessment of nonlinear dimensionality reduction
Abstract. Nonlinear dimensionality reduction aims at providing lowdimensional representions of high-dimensional data sets. Many new methods have been proposed in the recent years, ...
John Aldo Lee, Michel Verleysen
HCI
2007
13 years 10 months ago
Pictogram Retrieval Based on Collective Semantics
Abstract. To retrieve pictograms having semantically ambiguous interpretations, we propose a semantic relevance measure which uses pictogram interpretation words collected from a w...
Heeryon Cho, Toru Ishida, Rieko Inaba, Toshiyuki T...