Sciweavers

3708 search results - page 72 / 742
» Approximating Betweenness Centrality
Sort
View
MICAI
2004
Springer
15 years 10 months ago
Graduated Errors in Approximate Queries Using Hierarchies and Ordered Sets
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...
Adolfo Guzmán-Arenas, Serguei Levachkine
145
Voted
ICALP
1998
Springer
15 years 9 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
BIRTHDAY
2008
Springer
15 years 7 months ago
Approximating Behaviors in Embedded System Design
Embedded systems are electronic devices that function in the context of a physical environment, by sensing and reacting to a set of stimuli. To simplify the design of embedded syst...
Roberto Passerone, Alberto L. Sangiovanni-Vincente...
AAAI
1990
15 years 6 months ago
Approximation Reformulations
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
Daniel S. Weld
137
Voted
FOCS
2008
IEEE
15 years 11 months ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...