140 search results - page 16 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
WSC
2007
13 years 11 months ago
2007
This paper introduces an application and a methodology to predict future states of a process under real-time requirements. The real-time functionality is achieved by creating a Ba...
DAC
2008
ACM
14 years 9 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
MASCOTS
2004
13 years 10 months ago
2004
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
BIBE
2006
IEEE
14 years 2 months ago
2006
IEEE
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...