Sciweavers

222 search results - page 31 / 45
» The Parameterized Complexity of Regular Subgraph Problems an...
Sort
View
ICWE
2007
Springer
14 years 1 months ago
Engineering Semantic-Based Interactive Multi-device Web Applications
Abstract. To build high-quality personalized Web applications developers have to deal with a number of complex problems. We look at the growing class of personalized Web Applicatio...
Pieter Bellekens, Kees van der Sluijs, Lora Aroyo,...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
CIKM
2010
Springer
13 years 2 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
IJON
2010
178views more  IJON 2010»
13 years 6 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
SIBGRAPI
2008
IEEE
14 years 1 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...