4843 search results - page 338 / 969 » The Shortcut Problem - Complexity and Approximation |
124
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
138
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
133
click to vote
WASA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
151
click to vote
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
131
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...