Sciweavers

1389 search results - page 178 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
121
Voted
IJCAI
2007
15 years 4 months ago
Document Summarization Using Conditional Random Fields
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
Dou Shen, Jian-Tao Sun, Hua Li, Qiang Yang, Zheng ...
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 9 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
DMIN
2010
262views Data Mining» more  DMIN 2010»
15 years 1 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 11 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...