Sciweavers

286 search results - page 46 / 58
» Playing the Minesweeper with Constraints
Sort
View
ECCC
2010
91views more  ECCC 2010»
13 years 7 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
CORR
2007
Springer
52views Education» more  CORR 2007»
13 years 7 months ago
Hierarchical Unambiguity
Abstract. We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized...
Holger Spakowski, Rahul Tripathi
CCR
2004
120views more  CCR 2004»
13 years 7 months ago
MAC-layer anycasting in ad hoc networks
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Romit Roy Choudhury, Nitin H. Vaidya
TCAD
2002
91views more  TCAD 2002»
13 years 7 months ago
Retiming and clock scheduling for digital circuit optimization
Abstract--This paper investigates the application of simultaneous retiming and clock scheduling for optimizing synchronous circuits under setup and hold constraints. Two optimizati...
Xun Liu, Marios C. Papaefthymiou, Eby G. Friedman