Sciweavers

520 search results - page 75 / 104
» Reductions Between Expansion Problems
Sort
View
CPAIOR
2009
Springer
14 years 4 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
FMCAD
2009
Springer
14 years 4 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
ICB
2009
Springer
185views Biometrics» more  ICB 2009»
14 years 4 months ago
Pose Invariant Palmprint Recognition
Abstract. A palmprint based authentication system that can work with a multipurpose camera in uncontrolled circumstances, such as those mounted on a laptop, mobile device or those ...
Chhaya Methani, Anoop M. Namboodiri
OOPSLA
2009
Springer
14 years 4 months ago
Minimizing dependencies within generic classes for faster and smaller programs
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
Dan Tsafrir, Robert W. Wisniewski, David F. Bacon,...
INFOCOM
2008
IEEE
14 years 4 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...