Sciweavers

360 search results - page 65 / 72
» The TV-Break Packing Problem
Sort
View
FOCS
2006
IEEE
13 years 11 months ago
Witnesses for non-satisfiability of dense random 3CNF formulas
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
Uriel Feige, Jeong Han Kim, Eran Ofek
FPL
2000
Springer
122views Hardware» more  FPL 2000»
13 years 11 months ago
A Placement Algorithm for FPGA Designs with Multiple I/O Standards
State-of-the-art FPGAs possess I/O resources that can be configured to support a wide variety of I/O standards [1]. In such devices, the I/O resources are grouped into banks. One o...
Jason Helge Anderson, Jim Saunders, Sudip Nag, Cha...
EMNLP
2008
13 years 8 months ago
Forest-based Translation Rule Extraction
Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of ...
Haitao Mi, Liang Huang
ICVGIP
2008
13 years 8 months ago
Ray Casting Deformable Models on the GPU
The GPUs pack high computation power and a restricted architecture into easily available hardware today. They are now used as computation co-processors and come with programming m...
Suryakant Patidar, P. J. Narayanan
AAAI
1992
13 years 8 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...