Sciweavers

836 search results - page 122 / 168
» On the Complexity of Train Assignment Problems
Sort
View
CIIA
2009
15 years 5 months ago
Physical Synthesis for CPLD Architectures
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
Sid-Ahmed Senouci
AIEDAM
2007
90views more  AIEDAM 2007»
15 years 4 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou
CACM
2010
104views more  CACM 2010»
15 years 4 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
DATAMINE
2006
83views more  DATAMINE 2006»
15 years 4 months ago
Structural Hidden Markov Models Using a Relation of Equivalence: Application to Automotive Designs
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
Djamel Bouchaffra, Jun Tan
ECCC
2006
70views more  ECCC 2006»
15 years 4 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas