Sciweavers

1040 search results - page 173 / 208
» TCAM-conscious Algorithms for Data Streams
Sort
View
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
14 years 3 months ago
Paired Learners for Concept Drift
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
Stephen H. Bach, Marcus A. Maloof
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
14 years 3 months ago
Feature selection in conditional random fields for activity recognition
Abstract— Temporal classification, such as activity recognition, is a key component for creating intelligent robot systems. In the case of robots, classification algorithms mus...
Douglas L. Vail, John D. Lafferty, Manuela M. Velo...
LCPC
2007
Springer
14 years 3 months ago
A Novel Asynchronous Software Cache Implementation for the Cell-BE Processor
This paper describes the implementation of a runtime library for asynchronous communication in the Cell BE processor. The runtime library implementation provides with several servi...
Jairo Balart, Marc González, Xavier Martore...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 1 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
FCT
1991
Springer
14 years 15 days ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini