Sciweavers

14084 search results - page 2457 / 2817
» A Theory for Game Theories
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
16 years 1 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 9 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
PEPM
2009
ACM
17 years 7 months ago
Static Consistency Checking for Verilog Wire Interconnects
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
Cherif Salama, Gregory Malecha, Walid Taha, Jim Gr...

Book
363views
17 years 5 months ago
Computational Linguistics: Models, Resources, Applications
"Can computers meaningfully process human language? If this is difficult, why? If this is possible, how? This book introduces the reader to the fascinating science of computat...
Igor A. Bolshakov and Alexander Gelbukh
CVPR
2009
IEEE
17 years 1 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...
« Prev « First page 2457 / 2817 Last » Next »