Sciweavers

3630 search results - page 508 / 726
» How to Compare Treebanks
Sort
View
JEA
2008
112views more  JEA 2008»
15 years 6 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
CORR
2007
Springer
156views Education» more  CORR 2007»
15 years 6 months ago
Analysis of a Mixed Strategy for Multiple Relay Networks
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...
Peter Rost, Gerhard Fettweis
JMIV
2008
214views more  JMIV 2008»
15 years 6 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg
JMLR
2008
94views more  JMLR 2008»
15 years 6 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
JNCA
2008
154views more  JNCA 2008»
15 years 6 months ago
Novel route maintenance protocols for the Bluetooth ad hoc network with mobility
Bluetooth technology is specially designed for the wireless personal area networks to replace cable. Several challenges exist in Bluetooth scatternet formation and routing, since ...
Prasan Kumar Sahoo, Chih-Yung Chang, Sheng-Wen Cha...