Sciweavers

88 search results - page 13 / 18
» The Secrecy Graph and Some of its Properties
Sort
View
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 3 months ago
Relational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
Floris Geerts, Heikki Mannila, Evimaria Terzi
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
DKE
2006
79views more  DKE 2006»
14 years 9 months ago
Schema versioning in data warehouses: Enabling cross-version querying via schema augmentation
As several mature implementations of data warehousing systems are fully operational, a crucial role in preserving their up-to-dateness is played by the ability to manage the chang...
Matteo Golfarelli, Jens Lechtenbörger, Stefan...
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 8 months ago
Spectrum Sharing as Spatial Congestion Games
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
Sahand Haji Ali Ahmad, Cem Tekin, Mingyan Liu, Ric...
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
15 years 10 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito