Sciweavers

3604 search results - page 248 / 721
» All Common Subsequences
Sort
View
HT
2010
ACM
15 years 11 months ago
Of categorizers and describers: an evaluation of quantitative measures for tagging motivation
While recent research has advanced our understanding about the structure and dynamics of social tagging systems, we know little about (i) the underlying motivations for tagging (w...
Christian Körner, Roman Kern, Hans-Peter Grah...
PODS
2010
ACM
173views Database» more  PODS 2010»
15 years 11 months ago
Foundations of schema mapping management
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
INFOCOM
2002
IEEE
15 years 10 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
IWCMC
2009
ACM
15 years 10 months ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
15 years 10 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan