Sciweavers

581 search results - page 47 / 117
» In case you missed it
Sort
View
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 12 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
13 years 11 months ago
Reconstructing Randomized Social Networks
In social networks, nodes correspond to entities and edges to links between them. In most of the cases, nodes are also associated with a set of features. Noise, missing values or ...
Niko Vuokko, Evimaria Terzi
CORR
2010
Springer
118views Education» more  CORR 2010»
13 years 6 months ago
Estimating Probabilities in Recommendation Systems
Modeling ranked data is an essential component in a number of important applications including recommendation systems and websearch. In many cases, judges omit preference among un...
Mingxuan Sun, Guy Lebanon, Paul Kidwell
CASES
2006
ACM
14 years 4 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
IJAR
2010
105views more  IJAR 2010»
13 years 7 months ago
A tree augmented classifier based on Extreme Imprecise Dirichlet Model
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
G. Corani, C. P. de Campos