Sciweavers

966 search results - page 126 / 194
» Small Alliances in Graphs
Sort
View
ICDT
2009
ACM
150views Database» more  ICDT 2009»
14 years 10 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
CIKM
2009
Springer
14 years 4 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
CISS
2008
IEEE
14 years 4 months ago
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
Peter Marbach
GRAPHITE
2005
ACM
14 years 3 months ago
Uniting cartoon textures with computer assisted animation
We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing ima...
William Van Haevre, Fabian Di Fiore, Frank Van Ree...
SCALESPACE
2005
Springer
14 years 3 months ago
Discrete Representation of Top Points via Scale Space Tessellation
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, L...