Sciweavers

1389 search results - page 104 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Active Learning for Networked Data
We introduce a novel active learning algorithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the label...
Mustafa Bilgic, Lilyana Mihalkova, Lise Getoor
DCOSS
2008
Springer
15 years 5 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
15 years 9 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 4 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 4 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...