Sciweavers

303 search results - page 9 / 61
» Computing Minimal Spanning Subgraphs in Linear Time
Sort
View
COR
2007
80views more  COR 2007»
13 years 7 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 9 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
13 years 12 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
ACML
2009
Springer
14 years 2 months ago
Linear Time Model Selection for Mixture of Heterogeneous Components
Abstract: Our main contribution is to propose a novel model selection methodology, expectation minimization of information criterion (EMIC). EMIC makes a significant impact on the...
Ryohei Fujimaki, Satoshi Morinaga, Michinari Momma...
RTSS
2006
IEEE
14 years 1 months ago
Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks
In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor ...
Sharmila Subramaniam, Vana Kalogeraki, Themis Palp...