Sciweavers

796 search results - page 98 / 160
» Generalized Commitment Alignment
Sort
View
102
Voted
ALGORITHMICA
2010
88views more  ALGORITHMICA 2010»
15 years 26 days ago
Improved Bounds for Wireless Localization
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
105
Voted
SIGSOFT
2010
ACM
14 years 10 months ago
Updating requirements from tests during maintenance and evolution
Keeping requirements specification up-to-date during the evolution of a software system is an expensive task. Consequently, specifications are usually not updated and rapidly beco...
Eya Ben Charrada
124
Voted
EMNLP
2009
14 years 10 months ago
Lattice-based System Combination for Statistical Machine Translation
Current system combination methods usually use confusion networks to find consensus translations among different systems. Requiring one-to-one mappings between the words in candid...
Yang Feng, Yang Liu, Haitao Mi, Qun Liu, Yajuan L&...
114
Voted
ICMLA
2009
14 years 10 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
115
Voted
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 2 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...