Sciweavers

1356 search results - page 15 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
FOCS
2004
IEEE
15 years 9 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
IPL
2011
96views more  IPL 2011»
15 years 44 min ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
IJCNLP
2005
Springer
15 years 11 months ago
Inversion Transduction Grammar Constraints for Mining Parallel Sentences from Quasi-Comparable Corpora
Abstract. We present a new implication of Wu’s (1997) Inversion Transduction Grammar (ITG) Hypothesis, on the problem of retrieving truly parallel sentence translations from larg...
Dekai Wu, Pascale Fung
ICALP
2009
Springer
16 years 5 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
131
Voted
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 11 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