Sciweavers

3663 search results - page 380 / 733
» Problems in the ontology of computer programs
Sort
View
ICCV
2009
IEEE
16 years 11 months ago
Filter Flow
The filter flow problem is to compute a space-variant linear filter that transforms one image into another. This framework encompasses a broad range of transformations including...
Steven M. Seitz, Simon Baker
ICALP
2007
Springer
16 years 1 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
ICALP
2007
Springer
16 years 1 months ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
NCA
2003
IEEE
16 years 3 days ago
Optimal Content Placement for En-Route Web Caching
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
Anxiao Jiang, Jehoshua Bruck
FPL
2003
Springer
95views Hardware» more  FPL 2003»
16 years 1 days ago
Reconfigurable Hardware SAT Solvers: A Survey of Systems
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
Iouliia Skliarova, António de Brito Ferrari