502 search results - page 84 / 101 » Verifying Balanced Trees |
109
Voted
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
105
click to vote
WISEC
2010
ACM
14 years 10 months ago
2010
ACM
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
187
Voted
POPL
2008
ACM
16 years 23 days ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
EDBT
2008
ACM
16 years 17 days ago
2008
ACM
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
100
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...