Sciweavers

2698 search results - page 313 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 11 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 6 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
ICCV
2007
IEEE
16 years 8 months ago
Learning Globally-Consistent Local Distance Functions for Shape-Based Image Retrieval and Classification
We address the problem of visual category recognition by learning an image-to-image distance function that attempts to satisfy the following property: the distance between images ...
Andrea Frome, Yoram Singer, Fei Sha, Jitendra Mali...
CATS
1998
15 years 8 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
Weifa Liang, George Havas
ECCC
2008
108views more  ECCC 2008»
15 years 6 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans