Sciweavers

2218 search results - page 190 / 444
» Testing Expressibility Is Hard
Sort
View
ICFEM
2009
Springer
14 years 3 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
BCSHCI
2007
13 years 12 months ago
Use study on a home video editing system
To help consumers dealing with their growing amount of home video, we have developed the Edit While Watching (EWW) system. It is designed to automatically create an edited version...
Hans Weda, Marco Campanella
WSCG
2004
160views more  WSCG 2004»
13 years 11 months ago
Real-Time Rendering of 3D Magic Lenses having arbitrary convex Shapes
We present a real-time algorithm for rendering volumetric 3D Magic LensesTM having arbitrary convex shapes. During fragment processing the algorithm performs a second depth test u...
Timo Ropinski, Klaus Hinrichs
CC
2007
Springer
158views System Software» more  CC 2007»
13 years 10 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
JBI
2008
159views Bioinformatics» more  JBI 2008»
13 years 10 months ago
SEGS: Search for enriched gene sets in microarray data
Gene Ontology (GO) terms are often used to interpret the results of microarray experiments. The most common approach is to perform Fisher's exact tests to find gene sets anno...
Igor Trajkovski, Nada Lavrac, Jakub Tolar