Sciweavers

1403 search results - page 196 / 281
» Set cover algorithms for very large datasets
Sort
View
CN
2008
117views more  CN 2008»
14 years 10 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
SAC
2004
ACM
15 years 3 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
BMCBI
2010
198views more  BMCBI 2010»
14 years 10 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
14 years 11 months ago
A fast counterexample minimization approach with refutation analysis and incremental SAT
- It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ShengYu Shen, Ying Qin, Sikun Li
ECCV
2004
Springer
15 years 11 months ago
Simultaneous Object Recognition and Segmentation by Image Exploration
Methods based on local, viewpoint invariant features have proven capable of recognizing objects in spite of viewpoint changes, occlusion and clutter. However, these approaches fail...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...