Sciweavers

3791 search results - page 549 / 759
» Packing sets of patterns
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 10 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
DEXA
2009
Springer
173views Database» more  DEXA 2009»
15 years 10 months ago
Incremental Ontology-Based Extraction and Alignment in Semi-structured Documents
SHIRI 1 is an ontology-based system for integration of semistructured documents related to a specific domain. The system’s purpose is to allow users to access to relevant parts ...
Mouhamadou Thiam, Nacéra Bennacer, Nathalie...
DIS
2009
Springer
15 years 10 months ago
Contrasting Sequence Groups by Emerging Sequences
Abstract. Group comparison per se is a fundamental task in many scientific endeavours but is also the basis of any classifier. Contrast sets and emerging patterns contrast betwee...
Kang Deng, Osmar R. Zaïane
EMMCVPR
2009
Springer
15 years 10 months ago
Boundaries as Contours of Optimal Appearance and Area of Support
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Bayesian boundary models often assume tha...
Christina Pavlopoulou, Stella X. Yu
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
15 years 10 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd