Sciweavers

267 search results - page 48 / 54
» An FPGA Implementation for Solving Least Square Problem
Sort
View
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
14 years 1 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
CASCON
1996
77views Education» more  CASCON 1996»
13 years 10 months ago
Harvesting design for an application framework
Framework design begins with domain analysis. Either the problem domain is analyzed to create a new design, or the solution domain is analyzed to understand how the problem has al...
Joan Boone
BMCBI
2007
216views more  BMCBI 2007»
13 years 9 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos
HICSS
2011
IEEE
157views Biometrics» more  HICSS 2011»
13 years 27 days ago
Reusing Relational Queries for Intuitive Decision Optimization
— Decision optimization is used in many applications such as those for finding the best course of action in emergencies. However, optimization solutions require considerable mat...
Alexander Brodsky, Nathan E. Egge, Xiaoyang Sean W...
CIC
2004
118views Communications» more  CIC 2004»
13 years 10 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng