Sciweavers

6568 search results - page 311 / 1314
» Reducing the Complexity of Reductions
Sort
View
TCS
2008
15 years 6 months ago
The weak lambda calculus as a reasonable machine
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
Ugo Dal Lago, Simone Martini
IJAC
2007
116views more  IJAC 2007»
15 years 6 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
171
Voted
ICMCS
2006
IEEE
170views Multimedia» more  ICMCS 2006»
16 years 26 days ago
A Fast Mode Selection Algorithm in H.264 Video Coding
For improvement of coding efficiency, the H.264 video coding standard uses new coding tools, such as variable block size, quarter-pixel-accuracy motion estimation, multiple refere...
Donghyung Kim, Jechang Jeong
IJCAI
1989
15 years 8 months ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain
ISPD
2000
ACM
131views Hardware» more  ISPD 2000»
15 years 11 months ago
Multi-center congestion estimation and minimization during placement
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
Maogang Wang, Xiaojian Yang, Kenneth Eguro, Majid ...