Sciweavers

209 search results - page 27 / 42
» ideal 2009
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
CPAIOR
2009
Springer
15 years 4 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
78
Voted
DEXA
2009
Springer
124views Database» more  DEXA 2009»
15 years 4 months ago
VisiNav: Visual Web Data Search and Navigation
Semantic Web technologies facilitate data integration over a large number of sources with decentralised and loose coordination, ideally leading to interlinked datasets which descri...
Andreas Harth
EPIA
2009
Springer
15 years 4 months ago
An ILP System for Learning Head Output Connected Predicates
Inductive Logic Programming (ILP) [1] systems are general purpose learners that have had significant success on solving a number of relational problems, particularly from the biol...
José Carlos Almeida Santos, Alireza Tamaddo...
77
Voted
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
15 years 4 months ago
Integrating real-time analysis with the dendritic cell algorithm through segmentation
As an immune inspired algorithm, the Dendritic Cell Algorithm (DCA) has been applied to a range of problems, particularly in the area of intrusion detection. Ideally, the intrusio...
Feng Gu, Julie Greensmith, Uwe Aickelin