Sciweavers

1431 search results - page 17 / 287
» The complexity of random ordered structures
Sort
View
LATA
2010
Springer
14 years 4 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
ICPR
2000
IEEE
14 years 8 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
14 years 1 months ago
QuteSAT: a robust circuit-based SAT solver for complex circuit structure
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang...
AVI
2004
13 years 8 months ago
A graph-based interface to complex hypermedia structure visualization
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
Manuel Freire, Pilar Rodríguez
IROS
2007
IEEE
147views Robotics» more  IROS 2007»
14 years 1 months ago
Compact magnetic wheeled robot with high mobility for inspecting complex shaped pipe structures
— This paper describes a compact robot with two magnetic wheels in a bicycle arrangement, which is intended for inspecting the inner casing of pipes with complex shaped structure...
Fabien Tâche, Wolfgang Fischer, Roland Siegw...