Sciweavers

927 search results - page 162 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
102
Voted
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 4 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
143
Voted
IJCNN
2007
IEEE
15 years 6 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
CHI
1999
ACM
15 years 4 months ago
Design Guidelines for Landmarks to Support Navigation in Virtual Environments
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
Norman G. Vinson
109
Voted
TSP
2008
109views more  TSP 2008»
15 years 11 days ago
Constrained Tensor Modeling Approach to Blind Multiple-Antenna CDMA Schemes
In this paper, we consider an uplink multiple-antenna Code-Division Multiple-Access (CDMA) system linking several multiple-antenna mobile users to one multiple-antenna base-statio...
André L. F. de Almeida, Gérard Favie...
111
Voted
SIGCOMM
2006
ACM
15 years 6 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...