Sciweavers

1302 search results - page 95 / 261
» Fair Equivalence Relations
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 10 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
COMBINATORICS
2004
96views more  COMBINATORICS 2004»
13 years 10 months ago
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
Nicholas A. Loehr, Jeffrey B. Remmel
MSCS
2010
84views more  MSCS 2010»
13 years 8 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi
CVPR
2011
IEEE
13 years 6 months ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller
EDBT
2006
ACM
117views Database» more  EDBT 2006»
14 years 1 months ago
Model-Independent Schema and Data Translation
Abstract. We describe MIDST, an implementation of the model management operator ModelGen, which translates schemas from one model to another, for example from OO to SQL or from SQL...
Paolo Atzeni, Paolo Cappellari, Philip A. Bernstei...