Sciweavers

2265 search results - page 343 / 453
» On the Power of Local Orientations
Sort
View
85
Voted
APAL
2010
85views more  APAL 2010»
15 years 25 days ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
MA
2010
Springer
135views Communications» more  MA 2010»
14 years 11 months ago
Nonparametric comparison of regression functions
In this work we provide a new methodology for comparing regression functions m1 and m2 from two samples. Since apart from smoothness no other (parametric) assumptions are required...
Ramidha Srihera, Winfried Stute
PODC
2011
ACM
14 years 3 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
106
Voted
ECCV
2008
Springer
16 years 2 months ago
Flexible Depth of Field Photography
The range of scene depths that appear focused in an image is known as the depth of field (DOF). Conventional cameras are limited by a fundamental trade-off between depth of field a...
Hajime Nagahara, Sujit Kuthirummal, Changyin Zhou,...
83
Voted
DAC
2000
ACM
16 years 1 months ago
Can recursive bisection alone produce routable placements?
This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the stateof-the-art after two decades of research in recursive ...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...