Sciweavers

2659 search results - page 460 / 532
» Do we mean the same
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 4 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
FSTTCS
2007
Springer
14 years 4 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth
WAPCV
2007
Springer
14 years 4 months ago
Differences and Interactions Between Cerebral Hemispheres When Processing Ambiguous Words
It is well known that the brain (especially the cortex) is structurally separable into two hemispheres. Many neuropsychological studies show that the process of ambiguity resoluti...
Orna Peleg, Zohar Eviatar, Hananel Hazan, Larry M....
IEEEPACT
2005
IEEE
14 years 3 months ago
Instruction Based Memory Distance Analysis and its Application
Feedback-directed Optimization has become an increasingly important tool in designing and building optimizing compilers as itprovides a means to analyze complexprogram behavior th...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
MSR
2005
ACM
14 years 3 months ago
Improving evolvability through refactoring
Refactoring is one means of improving the structure of existing software. Locations for the application of refactoring are often based on subjective perceptions such as ”bad sme...
Jacek Ratzinger, Michael Fischer, Harald Gall