232 search results - page 11 / 47 » On Characterizing the Data Access Complexity of Programs |
102
click to vote
KRDB
2003
15 years 1 days ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
MOBIHOC
2009
ACM
15 years 11 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
101
click to vote
ESOP
2008
Springer
15 years 13 days ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
DSD
2010
IEEE
14 years 11 months ago
2010
IEEE
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
115
click to vote
BMCBI
2002
14 years 10 months ago
2002
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...