Sciweavers

4114 search results - page 320 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
16 years 7 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 8 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
ACL
1998
15 years 8 months ago
Part of Speech Tagging Using a Network of Linear Separators
We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separat...
Dan Roth, Dmitry Zelenko
WEBI
2010
Springer
15 years 4 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
16 years 4 days ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher