Sciweavers

165 search results - page 10 / 33
» Solving the Region Growing Problem on the Connection Machine
Sort
View
SIBGRAPI
2005
IEEE
14 years 1 months ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
SAINT
2006
IEEE
14 years 1 months ago
Fluid-Based Analysis of a Network with DCCP Connections and RED Routers
In this paper, we model DCCP congestion control mechanism and RED as independent discrete-time systems using fluid-flow approximation. By interconnecting DCCP connections and RE...
Hiroyuki Hisamatsu, Hiroyuki Ohsaki, Masayuki Mura...
RECOMB
2010
Springer
14 years 2 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
EUROCOLT
1999
Springer
13 years 11 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
14 years 1 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle