Sciweavers

1568 search results - page 124 / 314
» The problem of examination questions in algorithmics
Sort
View
CBMS
2006
IEEE
15 years 10 months ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
175
Voted
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
15 years 11 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 11 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
15 years 9 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
15 years 6 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena