Sciweavers

60 search results - page 6 / 12
» When lisp is faster than C
Sort
View
JUCS
2006
175views more  JUCS 2006»
13 years 7 months ago
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
Anderson Faustino da Silva, Vítor Santos Co...
BMVC
2010
13 years 5 months ago
Additive Update Predictors in Active Appearance Models
The Active Appearance Model (AAM) provides an efficient method for localizing objects that vary in both shape and texture, and uses a linear regressor to predict updates to model ...
Philip A. Tresadern, Patrick Sauer, Timothy F. Coo...
EUROPAR
2010
Springer
13 years 5 months ago
Starsscheck: A Tool to Find Errors in Task-Based Parallel Programs
Star Superscalar is a task-based programming model. The programmer starts with an ordinary C program, and adds pragmas to mark functions as tasks, identifying their inputs and outp...
Paul M. Carpenter, Alex Ramírez, Eduard Ayg...
ICCV
2011
IEEE
12 years 7 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert
WS
2003
ACM
14 years 18 days ago
Rushing attacks and defense in wireless ad hoc network routing protocols
In an ad hoc network, mobile computers (or nodes) cooperate to forward packets for each other, allowing nodes to communicate beyond their direct wireless transmission range. Many ...
Yih-Chun Hu, Adrian Perrig, David B. Johnson