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
1802
search results - page 18 / 361
»
Sparse Computations with PEI
Sort
relevance
views
votes
recent
update
View
thumb
title
10
click to vote
VLDB
1997
ACM
83
views
Database
»
more
VLDB 1997
»
Fast Computation of Sparse Datacubes
13 years 11 months ago
Download
www.vldb.org
Kenneth A. Ross, Divesh Srivastava
claim paper
Read More »
13
click to vote
ECCC
2006
65
views
more
ECCC 2006
»
Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata
13 years 6 months ago
Download
osl.cs.uiuc.edu
Predrag T. Tosic
claim paper
Read More »
7
click to vote
FSS
2006
81
views
more
FSS 2006
»
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
13 years 6 months ago
Download
www.image.ntua.gr
Manolis Wallace, Yannis S. Avrithis, Stefanos D. K...
claim paper
Read More »
17
click to vote
NECO
2006
60
views
more
NECO 2006
»
On the Computational Power of Threshold Circuits with Sparse Activity
13 years 6 months ago
Download
www.igi.tugraz.at
Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advan1
Kei Uchizawa, Rodney J. Douglas, Wolfgang Maass
claim paper
Read More »
19
click to vote
TCS
2008
102
views
Theoretical Computer Science
»
more
TCS 2008
»
Main-memory triangle computations for very large (sparse (power-law)) graphs
13 years 6 months ago
Download
www-rp.lip6.fr
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
claim paper
Read More »
« Prev
« First
page 18 / 361
Last »
Next »