Sciweavers

28 search results - page 3 / 6
» The Termination Competition
Sort
View
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
IAT
2007
IEEE
14 years 1 months ago
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resource...
Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, J...
ACL
2003
13 years 9 months ago
Counter-Training in Discovery of Semantic Patterns
This paper presents a method for unsupervised discovery of semantic patterns. Semantic patterns are useful for a variety of text understanding tasks, in particular for locating ev...
Roman Yangarber
SIAMCO
2008
112views more  SIAMCO 2008»
13 years 7 months ago
A Knowledge-Gradient Policy for Sequential Information Collection
In a sequential Bayesian ranking and selection problem with independent normal populations and common known variance, we study a previously introduced measurement policy which we ...
Peter Frazier, Warren B. Powell, Savas Dayanik
ACL
2011
12 years 11 months ago
An Unsupervised Model for Joint Phrase Alignment and Extraction
We present an unsupervised model for joint phrase alignment and extraction using nonparametric Bayesian methods and inversion transduction grammars (ITGs). The key contribution is...
Graham Neubig, Taro Watanabe, Eiichiro Sumita, Shi...