Sciweavers

6248 search results - page 118 / 1250
» Programming in a data factory
Sort
View
ICALP
2003
Springer
15 years 11 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
ICRA
2006
IEEE
86views Robotics» more  ICRA 2006»
16 years 13 days ago
The Statistical Dynamics of Programmed Self-assembly
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
Nils Napp, Samuel Burden, Eric Klavins
CP
2007
Springer
15 years 10 months ago
Exploring Different Constraint-Based Modelings for Program Verification
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. Constraint generated for these ta...
Hélène Collavizza, Michel Rueher
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
16 years 7 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro
WWW
2001
ACM
16 years 7 months ago
Algorithms and programming models for efficient representation of XML for Internet applications
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
Neel Sundaresan, Reshad Moussa