Sciweavers

868 search results - page 81 / 174
» Finding Most Likely Solutions
Sort
View
CP
2009
Springer
14 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
CHI
2005
ACM
14 years 10 months ago
Glimpse: a novel input model for multi-level devices
We describe a technique that supports the previewing of navigation, exploration, and editing operations by providing convenient Undo for unsuccessful and/or undesirable actions on...
Clifton Forlines, Chia Shen
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
14 years 10 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
KBSE
2009
IEEE
14 years 4 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
ICPR
2008
IEEE
14 years 4 months ago
Adaptive nonstationary regression analysis
The problem of finding the most appropriate subset of features or regressors is the generic challenge of Machine Learning problems like regression estimation or pattern recognitio...
Olga Krasotkina, Vadim Mottl