Sciweavers

794 search results - page 88 / 159
» Improved algorithms for orienteering and related problems
Sort
View
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 2 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
EMSOFT
2004
Springer
14 years 2 months ago
An approach for integrating basic retiming and software pipelining
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
Noureddine Chabini, Wayne Wolf
IPPS
2002
IEEE
14 years 1 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 9 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
ICDE
2001
IEEE
143views Database» more  ICDE 2001»
14 years 10 months ago
Exactly-once Semantics in a Replicated Messaging System
A distributed message delivery system can use replication to improve performance and availability. However, without safeguards, replicated messages may be delivered to a mobile de...
Yongqiang Huang, Hector Garcia-Molina