Sciweavers

2613 search results - page 496 / 523
» On an Optimization Problem in Sensor Selection*
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
15 years 1 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...
JPDC
2006
103views more  JPDC 2006»
15 years 1 months ago
Fractal: A mobile code-based framework for dynamic application protocol adaptation
The rapid growth of heterogeneous devices and diverse networks in our daily life, makes it is very difficult, if not impossible, to build a one-size-fits-all application or protoc...
Hanping Lufei, Weisong Shi
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 1 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 1 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
COCOA
2009
Springer
15 years 6 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya