Sciweavers

108 search results - page 20 / 22
» Pixel Approximation Errors in Common Watershed Algorithms
Sort
View
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
BMCBI
2007
197views more  BMCBI 2007»
13 years 7 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
14 years 8 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...
WWW
2010
ACM
14 years 2 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura
IROS
2006
IEEE
96views Robotics» more  IROS 2006»
14 years 1 months ago
Topological Mapping Inspired by Techniques in DNA Sequence Alignment
Abstract— This paper introduces a method of building topological maps using sequences of images and the approximate string matching algorithm, which is commonly used in DNA seque...
Alan M. Zhang, Lindsay Kleeman, R. Andrew Russell