Sciweavers

1702 search results - page 82 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
STACS
2007
Springer
14 years 3 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
ICCAD
1995
IEEE
163views Hardware» more  ICCAD 1995»
14 years 18 days ago
Signal integrity optimization on the pad assignment for high-speed VLSI design
Pad assignment with signal integrity optimization is very important for high-speed VLSI design. In this paper, an efficient method is proposed to effectively minimize both simulta...
Kai-Yuan Chao, D. F. Wong
DCOSS
2006
Springer
14 years 21 days ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ICCAD
2003
IEEE
114views Hardware» more  ICCAD 2003»
14 years 6 months ago
A Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
Peter G. Sassone, Sung Kyu Lim
DATAMINE
2002
155views more  DATAMINE 2002»
13 years 8 months ago
Efficient Adaptive-Support Association Rule Mining for Recommender Systems
Collaborative recommender systems allow personalization for e-commerce by exploiting similarities and dissimilarities among customers' preferences. We investigate the use of a...
Weiyang Lin, Sergio A. Alvarez, Carolina Ruiz