Sciweavers

342 search results - page 28 / 69
» Using Decision Trees to Construct a Practical Parser
Sort
View
DEXA
2007
Springer
154views Database» more  DEXA 2007»
14 years 2 months ago
Beyond Lazy XML Parsing
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
Fernando Farfán, Vagelis Hristidis, Raju Ra...
DCOSS
2006
Springer
14 years 11 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
ICCSA
2007
Springer
14 years 2 months ago
Tracing Illegal Users of Video: Reconsideration of Tree-Specific and Endbuyer-Specific Methods
In our recent study, we have presented an approach for tracing illegal users in content distribution networks using watermarking and fingerprinting techniques [1][2]. In this paper...
Hyun-Ho Kang, Brian M. Kurkoski, Kazuhiko Yamaguch...
PRL
2008
213views more  PRL 2008»
13 years 8 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
JFP
2006
113views more  JFP 2006»
13 years 8 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas