Sciweavers

4095 search results - page 109 / 819
» How to test a tree
Sort
View
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
IROS
2007
IEEE
142views Robotics» more  IROS 2007»
14 years 4 months ago
GPS moving performance on open sky and forested paths
— In this paper we present a systematic study of the performance of seven different configurations of GPS on a moving vehicle using three different GPS receivers. The seven diff...
Luis Yoichi Morales Saiki, Takashi Tsubouchi
BMCBI
2007
147views more  BMCBI 2007»
13 years 10 months ago
MaxAlign: maximizing usable data in an alignment
Background: The presence of gaps in an alignment of nucleotide or protein sequences is often an inconvenience for bioinformatical studies. In phylogenetic and other analyses, for ...
Rodrigo Gouveia-Oliveira, Peter Wad Sackett, Ander...
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
14 years 4 months ago
Slow write driver faults in 65nm SRAM technology: analysis and March test solution
∗ This paper presents an analysis of the electrical origins of Slow Write Driver Faults (SWDFs) [1] that may affect SRAM write drivers in 65nm technology. This type of fault is t...
Alexandre Ney, Patrick Girard, Christian Landrault...
SAC
2004
ACM
14 years 3 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha