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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
7988
search results - page 53 / 1598
»
A Useful Undecidable Theory
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
FSTTCS
2009
Springer
100
views
Software Engineering
»
more
FSTTCS 2009
»
Using Elimination Theory to construct Rigid Matrices
14 years 3 months ago
Download
itcs.tsinghua.edu.cn
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Pa...
claim paper
Read More »
19
click to vote
DEXAW
2008
IEEE
111
views
Database
»
more
DEXAW 2008
»
A Formalization of Logical Imaging for Information Retrieval Using Quantum Theory
14 years 3 months ago
Download
www.uni-weimar.de
Guido Zuccon, Leif Azzopardi, C. J. van Rijsbergen
claim paper
Read More »
29
click to vote
RSKT
2007
Springer
114
views
Information Technology
»
more
RSKT 2007
»
Using Rough Set Theory to Induce Pavement Maintenance and Rehabilitation Strategy
14 years 3 months ago
Download
myweb.caece.net
Jia-Ruey Chang, Ching-Tsung Hung, Gwo-Hshiung Tzen...
claim paper
Read More »
23
click to vote
IPPS
2006
IEEE
87
views
Distributed And Parallel Com...
»
more
IPPS 2006
»
A general data dependence analysis to nested loop using integer interval theory
14 years 2 months ago
Download
www.cecs.uci.edu
Jing Zhou, Guosun Zeng
claim paper
Read More »
23
click to vote
LICS
2006
IEEE
90
views
Automated Reasoning
»
more
LICS 2006
»
A Proof of Strong Normalisation using Domain Theory
14 years 2 months ago
Download
arnaud.spiwack.free.fr
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
Thierry Coquand, Arnaud Spiwack
claim paper
Read More »
« Prev
« First
page 53 / 1598
Last »
Next »