Sciweavers

2513 search results - page 129 / 503
» Improving Generalization by Data Categorization
Sort
View
PODC
2010
ACM
15 years 10 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
ICIP
2002
IEEE
16 years 8 months ago
Reversible data hiding
We present a novel reversible (lossless) data hiding (embedding) technique, which enables the exact recovery of the original host signal upon extraction of the embedded informatio...
Mehmet Utku Celik, Gaurav Sharma, Eli Saber, A. Mu...
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 11 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
WIDM
2009
ACM
16 years 28 days ago
Semantic relatedness hits bibliographic data
In this paper we introduce a novel approach for the thematic organization of bibliographic records that builds upon a semantic relatedness measure we have implemented for this tas...
George Tsatsaronis, Iraklis Varlamis, Sofia Stamou...
MDM
2005
Springer
116views Communications» more  MDM 2005»
15 years 12 months ago
Data dissemination in mobile peer-to-peer networks
In this paper we propose adaptive content-driven routing and data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile ...
Thomas Repantis, Vana Kalogeraki