Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16666
search results - page 49 / 3334
»
Descriptive and Computational Complexity
Sort
relevance
views
votes
recent
update
View
thumb
title
97
Voted
ORL
2010
76
views
more
ORL 2010
»
Small bipartite subgraph polytopes
15 years 1 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 »
98
Voted
SOFSEM
2010
Springer
137
views
Theoretical Computer Science
»
more
SOFSEM 2010
»
Comparison of Scoring and Order Approach in Description Logic EL(D)
16 years 12 days ago
Download
www.sofsem.cz
Veronika Vaneková, Peter Vojtás
claim paper
Read More »
104
click to vote
IEEESCC
2007
IEEE
85
views
Applied Computing
»
more
IEEESCC 2007
»
Checking e-service consistency using Description Logics
15 years 9 months ago
Download
www.dis.uniroma1.it
Luigi Dragone, Riccardo Rosati
claim paper
Read More »
87
Voted
SAC
2006
ACM
86
views
Applied Computing
»
more
SAC 2006
»
An evaluation of resource description quality measures
15 years 9 months ago
Download
www.dcs.gla.ac.uk
Mark Baillie, Leif Azzopardi, Fabio Crestani
claim paper
Read More »
100
Voted
DCC
1999
IEEE
74
views
Computer Graphics
»
more
DCC 1999
»
Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets
15 years 7 months ago
Download
research.microsoft.com
Philip A. Chou, Sanjeev Mehrotra, Albert Wang
claim paper
Read More »
« Prev
« First
page 49 / 3334
Last »
Next »