Sciweavers

1915 search results - page 306 / 383
» Computing LTS Regression for Large Data Sets
Sort
View
PVLDB
2008
108views more  PVLDB 2008»
15 years 27 days ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
JAIR
2010
132views more  JAIR 2010»
14 years 12 months ago
Using Local Alignments for Relation Recognition
This paper discusses the problem of marrying structural similarity with semantic relatedness for Information Extraction from text. Aiming at accurate recognition of relations, we ...
Sophia Katrenko, Pieter W. Adriaans, Maarten van S...
IJWMC
2010
103views more  IJWMC 2010»
14 years 10 months ago
Programmable agents for efficient topology formation of Bluetooth scatternets
The past few years have seen a burst in public interest and widespread use of portable electronic devices featuring both mature and emerging technologies for wireless communication...
Sergio González-Valenzuela, Son T. Vuong, V...
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
14 years 8 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 4 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon