Search Sciweavers | Sciweavers

16666 search results - page 49 / 3334

» Descriptive and Computational Complexity

120

click to vote

ORL
2010

76views more ORL 2010»

Small bipartite subgraph polytopes

15 years 5 months ago

Download www.lancs.ac.uk

We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these ...

Laura Galli, Adam N. Letchford

claim paper

Read More »

134

click to vote

SOFSEM
2010
Springer

137views Theoretical Computer Science» more SOFSEM 2010»

Comparison of Scoring and Order Approach in Description Logic EL(D)

16 years 3 months ago

Download www.sofsem.cz

Veronika Vaneková, Peter Vojtás

claim paper

Read More »

139

click to vote

IEEESCC
2007
IEEE

85views Applied Computing» more IEEESCC 2007»

Checking e-service consistency using Description Logics

16 years 27 days ago

Download www.dis.uniroma1.it

Luigi Dragone, Riccardo Rosati

claim paper

Read More »

118

click to vote

SAC
2006
ACM

86views Applied Computing» more SAC 2006»

An evaluation of resource description quality measures

16 years 16 days ago

Download www.dcs.gla.ac.uk

Mark Baillie, Leif Azzopardi, Fabio Crestani

claim paper

Read More »

134

click to vote

DCC
1999
IEEE

74views Computer Graphics» more DCC 1999»

Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets

15 years 11 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers