Sciweavers

9736 search results - page 46 / 1948
» How Fast Can We Compute Products
Sort
View
EUROSYS
2010
ACM
16 years 1 months ago
Kivati: Fast Detection and Prevention of Atomicity Violations
Bugs in concurrent programs are extremely difficult to find and fix during testing. In this paper, we propose Kivati, which can efficiently detect and prevent atomicity violat...
Lee Chew, David Lie
ROBOCUP
2004
Springer
158views Robotics» more  ROBOCUP 2004»
15 years 9 months ago
Plug and Play: Fast Automatic Geometry and Color Calibration for Cameras Tracking Robots
We have developed an automatic calibration method for a global camera system. Firstly, we show how to define automatically the color maps we use for tracking the robots’ markers...
Anna Egorova, Mark Simon, Fabian Wiesel, Alexander...
EUC
2006
Springer
15 years 8 months ago
Automatic Generation of Hardware/Software Interface with Product-Specific Debugging Tools
Software programmers want to manage pure software, not hardware-software entanglements. Unfortunately, traditional development methodologies cannot clearly separate hardware and so...
Jeong-Han Yun, Gunwoo Kim, Choonho Son, Taisook Ha...
ISVC
2009
Springer
15 years 11 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
IUI
2004
ACM
15 years 10 months ago
What role can adaptive support play in an adaptable system?
As computer applications become larger with every new version, there is a growing need to provide some way for users to manage the interface complexity. There are three different ...
Andrea Bunt, Cristina Conati, Joanna McGrenere