Sciweavers

3360 search results - page 393 / 672
» Opportunistic Data Structures with Applications
Sort
View
PVLDB
2010
200views more  PVLDB 2010»
15 years 4 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
ICMCS
2009
IEEE
132views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Video face recognition with graph-based semi-supervised learning
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...
Effrosini Kokiopoulou, Pascal Frossard
IJUFKS
2010
77views more  IJUFKS 2010»
15 years 3 months ago
How to Handle Interval solutions for Cooperative Interval Games
Interval uncertainty affects our decision making activities on a daily basis making the data structure of intervals of real numbers more and more popular in theoretical models and...
Rodica Branzei, Stef Tijs, S. Z. Alparslan Gö...
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 1 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
JCNS
2010
103views more  JCNS 2010»
15 years 1 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski