232 search results - page 1 / 47 » On Characterizing the Data Access Complexity of Programs |
159
click to vote
PATMOS
2004
Springer
16 years 3 days ago
2004
Springer
We present SoftExplorer, a tool to estimate and analyze the power and energy consumption of an algorithm from the C program. The consumption of every loop is analyzed, and the inï¬...
203
Voted
AAAI
2006
15 years 8 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
277
Voted
AICT
2009
IEEE
16 years 1 months ago
2009
IEEE
Unlike other wireless technologies, the deployment of 802.11 networks is not limited to operators: access points can easily be installed by end-users for domestic use. This singul...
211
Voted
CODES
2005
IEEE
16 years 11 days ago
2005
IEEE
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
167
Voted
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...