Sciweavers

124 search results - page 7 / 25
» The spread of the unicyclic graphs
Sort
View
ACCV
2006
Springer
14 years 1 months ago
Super Resolution Using Graph-Cut
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
Uma Mudenagudi, Ram Singla, Prem Kumar Kalra, Subh...
AMKM
2003
Springer
14 years 25 days ago
A Spreading Activation Framework for Ontology-Enhanced Adaptive Information Access within Organisations
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
Md Maruf Hasan
ACL
2012
11 years 10 months ago
Tweet Recommendation with Graph Co-Ranking
As one of the most popular micro-blogging services, Twitter attracts millions of users, producing millions of tweets daily. Shared information through this service spreads faster ...
Rui Yan, Mirella Lapata, Xiaoming Li
AISS
2010
161views more  AISS 2010»
13 years 5 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber