Sciweavers

1289 search results - page 60 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
AIL
2004
107views more  AIL 2004»
14 years 9 months ago
AI and the Conquest of Complexity in Law
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
L. Bibel
ICMCS
2009
IEEE
132views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Video face recognition with graph-based semi-supervised learning
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...
Effrosini Kokiopoulou, Pascal Frossard
VLSID
2002
IEEE
131views VLSI» more  VLSID 2002»
15 years 10 months ago
Divide-and-Conquer IDDQ Testing for Core-Based System Chips
IDDQ testing has been used as a test technique to supplement voltage testing of CMOS chips. The idea behind IDDQ testing is to declare a chip as faulty if the steady-state current...
C. P. Ravikumar, Rahul Kumar
DAC
2009
ACM
15 years 10 months ago
ILP-based pin-count aware design methodology for microfluidic biochips
Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. To make the biochip feasible for practical applications, pin-count reduction is a k...
Cliff Chiung-Yu Lin, Yao-Wen Chang
MFCS
2000
Springer
15 years 1 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks