Sciweavers

2778 search results - page 231 / 556
» Limit complexities revisited
Sort
View
BDA
2007
15 years 8 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
COR
2008
116views more  COR 2008»
15 years 6 months ago
Robust multiperiod portfolio management in the presence of transaction costs
We study the viability of different robust optimization approaches to multiperiod portfolio selection. Robust optimization models treat future asset returns as uncertain coefficie...
Dimitris Bertsimas, Dessislava Pachamanova
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 6 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot
CAD
2006
Springer
15 years 6 months ago
Towards mass customized interoperability
This paper describes an approach to interoperability in design projects that is based on computational agents customizing the representation of product data to individual design to...
Udo Kannengiesser, John S. Gero