Sciweavers

1594 search results - page 62 / 319
» Fast Prediction on a Tree
Sort
View
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 9 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ICCCN
2007
IEEE
14 years 2 months ago
Global Path-Cache Technique for Fast Handoffs in WLANs
Abstract—This paper proposes a technique called Global PathCache (GPC) that provides fast handoffs in WLANs. GPC maintains a history of mobile stations’ mobility patterns in a ...
Weetit Wanalertlak, Ben Lee
ICML
2004
IEEE
14 years 1 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
EMNLP
2007
13 years 9 months ago
Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
Ivan Titov, James Henderson
GLVLSI
2008
IEEE
197views VLSI» more  GLVLSI 2008»
13 years 8 months ago
Efficient tree topology for FPGA interconnect network
This paper presents an improved Tree-based architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butterfly-FatTree topolo...
Zied Marrakchi, Hayder Mrabet, Emna Amouri, Habib ...