Sciweavers

13457 search results - page 69 / 2692
» Can we elect if we cannot compare
Sort
View
TCS
2010
13 years 6 months ago
Comparing free algebras in Topological and Classical Domain Theory
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...
Ingo Battenfeld
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary
EMNLP
2004
13 years 9 months ago
Comparing and Combining Generative and Posterior Probability Models: Some Advances in Sentence Boundary Detection in Speech
We compare and contrast two different models for detecting sentence-like units in continuous speech. The first approach uses hidden Markov sequence models based on N-grams and max...
Yang Liu, Andreas Stolcke, Elizabeth Shriberg, Mar...
ICMCS
2010
IEEE
258views Multimedia» more  ICMCS 2010»
13 years 8 months ago
A comparative study of similarity measures for content-based multimedia retrieval
Determining similarities among data objects is a core task of content-based multimedia retrieval systems. Approximating data object contents via flexible feature representations, ...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
TCS
2008
13 years 7 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev