Sciweavers

713 search results - page 86 / 143
» Using information about functions in selecting test cases
Sort
View
WCRE
2010
IEEE
15 years 2 months ago
Immediacy through Interactivity: Online Analysis of Run-time Behavior
—Visualizations of actual run-time data support the comprehension of programs, like examples support the ion of abstract concepts and principles. Unfortunately, the required run-...
Michael Perscheid, Bastian Steinert, Robert Hirsch...
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 4 months ago
High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes
This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
Joffrey Villard, Pascal Bianchi, Eric Moulines, Pa...
EKAW
2006
Springer
15 years 7 months ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
AAAI
2011
14 years 4 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
132
Voted
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 8 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram