Sciweavers

406 search results - page 2 / 82
» Constraints on Strong Generative Power
Sort
View
EVOW
1999
Springer
13 years 9 months ago
Test Pattern Generation Under Low Power Constraints
A technique is proposed to reduce the peak power consumption of sequential circuits during test pattern application. High-speed computation intensive VLSI systems, as telecommunica...
Fulvio Corno, Maurizio Rebaudengo, Matteo Sonza Re...
ACL
2000
13 years 6 months ago
Multi-Component TAG and Notions of Formal Power
This paper presents a restricted version of Set-Local Multi-Component TAGs Weir, 1988 which retains the strong generative capacity of Tree-Local MultiComponent TAG i.e. produces t...
William Schuler, David Chiang, Mark Dras
CVPR
2012
IEEE
11 years 7 months ago
The Shape Boltzmann Machine: A strong model of object shape
A good model of object shape is essential in applications such as segmentation, object detection, inpainting and graphics. For example, when performing segmentation, local constra...
S. M. Ali Eslami, Nicolas Heess, John M. Winn
ACL
2012
11 years 7 months ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
13 years 10 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...