Sciweavers

Share
JMLR
2012
6 years 10 months ago
Perturbation based Large Margin Approach for Ranking
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
Eunho Yang, Ambuj Tewari, Pradeep D. Ravikumar
ACL
2011
7 years 12 months ago
Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation
We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subprobl...
Alexander M. Rush, Michael Collins
ISSPIT
2010
8 years 3 months ago
Accelerating the Nussinov RNA folding algorithm with CUDA/GPU
Graphics processing units (GPU) on commodity video cards have evolved into powerful computational devices. The RNA secondary structure arises from the primary structure and a backb...
Dar-Jen Chang, Christopher Kimmer, Ming Ouyang
EMNLP
2010
8 years 5 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
JUCS
2010
142views more  JUCS 2010»
8 years 6 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
JELIA
2010
Springer
8 years 6 months ago
A Dynamic-Programming Based ASP-Solver
Abstract. We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs fro...
Michael Morak, Reinhard Pichler, Stefan Rümme...
ISVC
2010
Springer
8 years 6 months ago
An Improved Shape Matching Algorithm for Deformable Objects Using a Global Image Feature
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...
Jibum Kim, Suzanne M. Shontz
IPL
2010
114views more  IPL 2010»
8 years 6 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
NAR
2007
129views more  NAR 2007»
8 years 7 months ago
taveRNA: a web suite for RNA algorithms and applications
We present taveRNA, a web server package that hosts three RNA web services: alteRNA, inteRNA and pRuNA. alteRNA is a new alternative for RNA secondary structure prediction. It is ...
Cagri Aksay, Raheleh Salari, Emre Karakoç, ...
AI
1999
Springer
8 years 8 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
books