Sciweavers

3758 search results - page 357 / 752
» A Complete Subsumption Algorithm
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
ICFP
2007
ACM
16 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
16 years 1 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
EICS
2009
ACM
16 years 1 months ago
Input evaluation of an eye-gaze-guided interface: Kalman filter vs. velocity threshold eye movement identification
This paper evaluates the input performance capabilities of Velocity Threshold (I-VT) and Kalman Filter (I-KF) eye movement detection models when employed for eye-gaze-guided inter...
Do Hyong Koh, Sandeep A. Munikrishne Gowda, Oleg V...
ICCAD
2008
IEEE
130views Hardware» more  ICCAD 2008»
16 years 1 months ago
Area-I/O flip-chip routing for chip-package co-design
— The area-I/O flip-chip package provides a high chip-density solution to the demand of more I/O’s in VLSI designs; it can achieve smaller package size, shorter wirelength, an...
Jia-Wei Fang, Yao-Wen Chang