Sciweavers

2663 search results - page 528 / 533
» How to Choose a Timing Model
Sort
View
POPL
2009
ACM
16 years 9 days ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
CHI
2005
ACM
16 years 1 days ago
WebGazeAnalyzer: a system for capturing and analyzing web reading behavior using eye gaze
Capturing and analyzing the detailed eye movements of a user while reading a web page can reveal much about the ways in which web reading occurs. The WebGazeAnalyzer system descri...
David Beymer, Daniel M. Russell
115
Voted
RECOMB
2006
Springer
15 years 12 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
103
Voted
RSP
2005
IEEE
164views Control Systems» more  RSP 2005»
15 years 5 months ago
High Level Synthesis for Data-Driven Applications
Abstract— John von Neumann proposed his famous architecture in a context where hardware was very expensive and bulky. His goal was to maximize functionality with minimal hardware...
Etienne Bergeron, Xavier Saint-Mleux, Marc Feeley,...
CP
2005
Springer
15 years 5 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell