Sciweavers

229 search results - page 34 / 46
» How Efficient Can Memory Checking Be
Sort
View
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
13 years 5 months ago
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
Daniel Munoz, Nicolas Vandapel, Martial Hebert
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
14 years 28 days ago
Authenticated Access for IPv6 Supported Mobility
Hierarchical Mobile IPv6 (HMIPv6) is a protocol that enhances Mobile IPv6 (MIPv6) with faster handovers. Neither HMIPv6 nor MIPv6 provides ways to authenticate roaming mobile node...
Paal Engelstad, Thomas Haslestad, Fréd&eacu...
PPOPP
2009
ACM
14 years 8 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...
POPL
2012
ACM
12 years 3 months ago
A type system for borrowing permissions
In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of conc...
Karl Naden, Robert Bocchino, Jonathan Aldrich, Kev...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 7 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu