Sciweavers

7289 search results - page 1104 / 1458
» A Dependent Set Theory
Sort
View
CIKM
2009
Springer
16 years 2 months ago
Relying on topic subsets for system ranking estimation
Ranking a number of retrieval systems according to their retrieval effectiveness without relying on costly relevance judgments was first explored by Soboroff et al [6]. Over th...
Claudia Hauff, Djoerd Hiemstra, Franciska de Jong,...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
16 years 2 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
CSEE
2009
Springer
16 years 2 months ago
Software Engineering Education for Bioinformatics
As software engineering educators, it is important for us to realize the increasing domainspecificity of software, and incorporate these changes in our design of teaching material...
Medha Umarji, Carolyn B. Seaman, Akif Günes K...
DAGM
2009
Springer
16 years 2 months ago
A Stereo Depth Recovery Method Using Layered Representation of the Scene
Recent progresses in stereo research imply that performance of the disparity estimation depends on the discontinuity localization in the disparity space which is generally predicat...
Tarkan Aydin, Yusuf Sinan Akgul
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 2 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
« Prev « First page 1104 / 1458 Last » Next »