Sciweavers

2836 search results - page 72 / 568
» Parsing Algorithms and Metrics
Sort
View
HT
2005
ACM
14 years 1 months ago
Parsing and interpreting ambiguous structures in spatial hypermedia
When reflecting on information, spatial hypermedia users express their understanding of the information’s structure visually. In order to facilitate this process, spatial hyperm...
Luis Francisco-Revilla, Frank M. Shipman III
NAACL
2010
13 years 5 months ago
From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
WCRE
1993
IEEE
13 years 12 months ago
Flexible Control for Program Recognition
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
Linda M. Wills
IR
2010
13 years 6 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar