Sciweavers

5022 search results - page 765 / 1005
» Data structures and problem solving using Java
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
15 years 2 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
ANTSW
2004
Springer
15 years 8 months ago
An Ant Approach to Membership Overlay Design
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
Vittorio Maniezzo, Marco A. Boschetti, Márk...
JUCS
2007
122views more  JUCS 2007»
15 years 2 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 3 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
15 years 2 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber