Sciweavers

5105 search results - page 267 / 1021
» An algorithm to determine peer-reviewers
Sort
View
FPGA
2000
ACM
119views FPGA» more  FPGA 2000»
15 years 10 months ago
Timing-driven placement for FPGAs
In this paper we introduce a new Simulated Annealingbased timing-driven placement algorithm for FPGAs. This paper has three main contributions. First, our algorithm employs a nove...
Alexander Marquardt, Vaughn Betz, Jonathan Rose
NIPS
2008
15 years 8 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 8 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
AAAI
1994
15 years 8 months ago
Just-In-Case Scheduling
This paper presents an algorithm, called JustIn-Case Scheduling, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prep...
Mark Drummond, John L. Bresina, Keith Swanson
DATAMINE
2006
230views more  DATAMINE 2006»
15 years 6 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu