Sciweavers

1170 search results - page 143 / 234
» How Fast Is Too Fast
Sort
View
CAGD
2008
98views more  CAGD 2008»
15 years 3 months ago
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
S. Schaefer, J. Warren
CORR
2010
Springer
188views Education» more  CORR 2010»
15 years 3 months ago
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible ...
Sahand Negahban, Pradeep Ravikumar, Martin J. Wain...
CN
2006
58views more  CN 2006»
15 years 3 months ago
Dynamically extending the Corral with native code for high-speed packet processing
By combining the Open Kernel Environment, a Click-like software model known as Corral and basic concepts of active networking, we allow third-party code to control the code organi...
Herbert Bos, Bart Samwel, Ilja Booij
CSDA
2007
105views more  CSDA 2007»
15 years 3 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
PE
2006
Springer
114views Optimization» more  PE 2006»
15 years 3 months ago
On the performance of Internet worm scanning strategies
In recent years, fast spreading worms, such as Code Red, Slammer, Blaster and Sasser, have become one of the major threats to the security of the Internet. In order to defend agai...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong