Sciweavers

943 search results - page 158 / 189
» How should data structures and algorithms be taught
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
MMT: Exploiting fine-grained parallelism in dynamic memory management
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solih...
ICTAC
2010
Springer
13 years 6 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
14 years 8 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
MOBIHOC
2002
ACM
14 years 7 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
WWW
2010
ACM
14 years 3 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla