Sciweavers

892 search results - page 61 / 179
» et 2007
Sort
View
LREC
2008
111views Education» more  LREC 2008»
13 years 10 months ago
Annotation of Information Structure: an Evaluation across different Types of Texts
We report on the evaluation of information structural annotation according to the Linguistic Information Structure Annotation Guidelines (LISA, (Dipper et al., 2007)). The annotat...
Julia Ritz, Stefanie Dipper, Michael Götze
DM
2010
103views more  DM 2010»
13 years 9 months ago
Rainbow paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...
IWPEC
2010
Springer
13 years 6 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
ICB
2007
Springer
207views Biometrics» more  ICB 2007»
14 years 23 days ago
Super-Resolved Faces for Improved Face Recognition from Surveillance Video
Characteristics of surveillance video generally include low resolution and poor quality due to environmental, storage and processing limitations. It is extremely difficult for comp...
Frank Lin, Clinton Fookes, Vinod Chandran, Sridha ...
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 10 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan