Sciweavers

672 search results - page 81 / 135
» Lower-stretch spanning trees
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 14 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
IPL
1998
119views more  IPL 1998»
13 years 7 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
MOR
2010
98views more  MOR 2010»
13 years 6 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
IPPS
2010
IEEE
13 years 5 months ago
Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
Bo Zhang, Binoy Ravindran
ACL
2009
13 years 5 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning