Sciweavers

326 search results - page 56 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
COMPGEOM
2006
ACM
15 years 7 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 3 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
FSTTCS
2009
Springer
15 years 10 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
ICSM
2002
IEEE
15 years 8 months ago
An Approach to Classify Software Maintenance Requests
When a software system critical for an organization exhibits a problem during its operation, it is relevant to fix it in a short period of time, to avoid serious economical losse...
Giuseppe A. Di Lucca, Massimiliano Di Penta, Sara ...
CAAN
2006
Springer
15 years 7 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin