Sciweavers

1795 search results - page 317 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
TCAD
2010
136views more  TCAD 2010»
13 years 4 months ago
Bounded Model Debugging
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
Brian Keng, Sean Safarpour, Andreas G. Veneris
TCSV
2010
13 years 4 months ago
Compressed Domain Video Object Segmentation
We propose a compressed domain video object segmentation method for MPEG or MPEG-like encoded videos. Computational superiority is the main advantage of the compressed domain proc...
Fatih Murat Porikli, Faisal I. Bashir, Huifang Sun
TNN
2010
147views Management» more  TNN 2010»
13 years 4 months ago
Theoretical Model for Mesoscopic-Level Scale-Free Self-Organization of Functional Brain Networks
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
J. Piersa, Filip Piekniewski, Tomasz Schreiber
DAC
2012
ACM
12 years 9 days ago
Is dark silicon useful?: harnessing the four horsemen of the coming dark silicon apocalypse
Due to the breakdown of Dennardian scaling, the percentage of a silicon chip that can switch at full frequency is dropping exponentially with each process generation. This utiliza...
Michael B. Taylor
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
14 years 11 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal