Sciweavers

15033 search results - page 2885 / 3007
» Complexity Theory and Algorithms
Sort
View
ICGI
2010
Springer
15 years 2 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
IJON
2010
178views more  IJON 2010»
15 years 2 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
INFOCOM
2010
IEEE
15 years 2 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer
PR
2010
126views more  PR 2010»
15 years 2 months ago
Discriminability and reliability indexes: Two new measures to enhance multi-image face recognition
In order to handle complex face image variations in face recognition, multi-image face recognition has been proposed, instead of using a single still-imagebased approach. In many ...
Weiwen Zou, Pong C. Yuen
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
15 years 2 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
« Prev « First page 2885 / 3007 Last » Next »