Sciweavers

2626 search results - page 490 / 526
» The complexity of stochastic sequences
Sort
View
ICALP
2009
Springer
16 years 2 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
SIGMOD
2007
ACM
128views Database» more  SIGMOD 2007»
16 years 2 months ago
A SQL: 1999 code generator for the pathfinder xquery compiler
The Pathfinder XQuery compiler has been enhanced by a new code generator that can target any SQL:1999-compliant relational database system (RDBMS). This code generator marks an im...
Torsten Grust, Manuel Mayr, Jan Rittinger, Sherif ...
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 2 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
125
Voted
ICSE
2004
IEEE-ACM
16 years 2 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun
CVPR
2010
IEEE
15 years 10 months ago
Linear View Synthesis Using a Dimensionality Gap Light Field Prior
Acquiring and representing the 4D space of rays in the world (the light field) is important for many computer vision and graphics applications. Yet, light field acquisition is c...
Anat Levin, Fredo Durand