Sciweavers

6300 search results - page 983 / 1260
» We have it easy, but do we have it right
Sort
View
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 7 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
ICIP
1999
IEEE
15 years 6 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
BMCBI
2010
117views more  BMCBI 2010»
15 years 1 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
IANDC
2008
74views more  IANDC 2008»
15 years 1 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
155
Voted
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 8 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...