Sciweavers

6279 search results - page 1143 / 1256
» Studies in Solution Sampling
Sort
View
CIKM
2009
Springer
15 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...
PAISI
2009
Springer
15 years 4 months ago
Discovering Compatible Top-K Theme Patterns from Text Based on Users' Preferences
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
Yongxin Tong, Shilong Ma, Dan Yu, Yuanyuan Zhang, ...
GROUP
2009
ACM
15 years 4 months ago
Information handover in time-critical work
Information transfer under time pressure and stress often leads to information loss. This paper studies the characteristics and problems of information handover from the emergency...
Aleksandra Sarcevic, Randall S. Burd
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
FOCS
2008
IEEE
15 years 4 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
« Prev « First page 1143 / 1256 Last » Next »