Sciweavers

455 search results - page 91 / 91
» Using Top Trees For Easy Programming of Tree Algorithms
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
13 years 8 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
WWW
2002
ACM
14 years 5 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...
SIGCOMM
2004
ACM
13 years 10 months ago
A scalable distributed information management system
We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building bloc...
Praveen Yalagandula, Michael Dahlin
ESWA
2007
176views more  ESWA 2007»
13 years 4 months ago
Credit scoring with a data mining approach based on support vector machines
The credit card industry has been growing rapidly recently, and thus huge numbers of consumers’ credit data are collected by the credit department of the bank. The credit scorin...
Cheng-Lung Huang, Mu-Chen Chen, Chieh-Jen Wang
ICALP
2009
Springer
14 years 5 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh