Search Sciweavers | Sciweavers

11231 search results - page 125 / 2247

» Digging for Data Structures

click to vote

ICCV
2001
IEEE

133views Computer Vision» more ICCV 2001»

Sparse PCA: Extracting Multi-scale Structure from Data

16 years 1 months ago

Download www.cs.utoronto.ca

Chakra Chennubhotla, Allan D. Jepson

claim paper

Read More »

click to vote

STOC
2009
ACM

120views Algorithms» more STOC 2009»

Bit-probe lower bounds for succinct data structures

16 years 2 days ago

Download www.cs.umd.edu

We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...

Emanuele Viola

claim paper

Read More »

click to vote

CADE
2005
Springer

117views Logical Reasoning» more CADE 2005»

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures

15 years 11 months ago

Download www.cs.wisc.edu

Greta Yorsh, Neil Immerman, Shmuel Sagiv, Siddhart...

claim paper

Read More »

139

click to vote

SIGMOD
2007
ACM

157views Database» more SIGMOD 2007»

Leveraging data and structure in ontology integration

15 years 11 months ago

Download www.cse.buffalo.edu

Lise Getoor, Octavian Udrea, Renée J. Mille...

claim paper

Read More »

click to vote

SODA
2010
ACM

409views Algorithms» more SODA 2010»

Data Structures for Range Minimum Queries in Multidimensional Arrays

15 years 8 months ago

Download www.cs.purdue.edu

Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...

Hao Yuan, Mikhail J. Atallah

claim paper

Read More »

« Prev « First page 125 / 2247 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers