4539 search results - page 240 / 908 » Approaches to Compute Workflow Complexity |
175
click to vote
ALMOB
2006
15 years 5 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
174
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
164
Voted
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
190
click to vote
KSEM
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
170
click to vote
EDCC
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents the design and implementation of the Distributed Autonomous Replication Management (DARM) framework built on top of the Spread group communication system. The ...