Search
Selected: All

When can we decide that a P-finite sequence is positive?

Computer Science – Symbolic Computation
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Can You Fold a Map?

Computer Science – Computational Geometry
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Crossings Count - Approximating the Minimum Spanning Tree

Computer Science – Computational Geometry
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Database Systems Meet the Grid

Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When did M31's disk form?

Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Do Differences Matter? On-Line Feature Extraction Through Cognitive Economy

Computer Science – Learning
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When do Numbers Really Matter?

Computer Science – Artificial Intelligence
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When G^2 is a Konig-Egervary graph?

Computer Science – Discrete Mathematics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Ignorance is Bliss

Computer Science – Artificial Intelligence
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Index Term Probability Violates the Classical Probability Axioms Quantum Probability can be a Necessary Theory for Information Retrieval

Computer Science – Information Retrieval
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When is a Function Securely Computable?

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When is a silicate melt not a liquid?

Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When is social computation better than the sum of its parts?

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When is there a representer theorem? Vector versus matrix regularizers

Computer Science – Learning
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When majority voting fails: Comparing quality assurance methods for noisy human computation environment

Computer Science – Social and Information Networks
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial

Computer Science – Symbolic Computation
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

When only the last one will do

Computer Science – Computer Science and Game Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.