Sciweavers

1007 search results - page 82 / 202
» The Complexity of Futile Questioning
Sort
View
MFCS
2004
Springer
15 years 9 months ago
Generation Problems
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
Elmar Böhler, Christian Glaßer, Bernhar...
133
Voted
INFOVIS
2003
IEEE
15 years 9 months ago
Visualization of Large-Scale Customer Satisfaction Surveys Using a Parallel Coordinate Tree
Satisfaction surveys are an important measurement tool in fields such as market research or human resources management. Serious studies consist of numerous questions and contain a...
Dominique Brodbeck, Luc Girardin
SIGMETRICS
2010
ACM
150views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Incentive compatibility and dynamics of congestion control
This paper studies under what conditions congestion control schemes can be both efficient, so that capacity is not wasted, and incentive compatible, so that each participant can m...
Brighten Godfrey, Michael Schapira, Aviv Zohar, Sc...
136
Voted
GEOS
2009
Springer
15 years 8 months ago
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
Prateek Jain, Peter Z. Yeh, Kunal Verma, Cory A. H...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 8 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic