Sciweavers

7123 search results - page 310 / 1425
» The Ordered Set of Rough Sets
Sort
View
CVPR
2011
IEEE
14 years 10 months ago
TaylorBoost: First and Second-order Boosting Algorithms with Explicit Margin Control
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vas...
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
ISCA
1991
IEEE
110views Hardware» more  ISCA 1991»
15 years 10 months ago
Dynamic Base Register Caching: A Technique for Reducing Address Bus Width
When address reference streams exhibit high degrees of spatial and temporal locality, many of the higher order address lines carry redundant information. By caching the higher ord...
Matthew K. Farrens, Arvin Park
DEXA
2008
Springer
85views Database» more  DEXA 2008»
15 years 8 months ago
Reordering of Location Identifiers for Indexing an RFID Tag Object Database
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...
Sungwoo Ahn, Bonghee Hong
JCT
2007
83views more  JCT 2007»
15 years 6 months ago
On 6-sparse Steiner triple systems
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We the...
A. D. Forbes, Mike J. Grannell, Terry S. Griggs