Sciweavers

1578 search results - page 74 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
CDC
2008
IEEE
187views Control Systems» more  CDC 2008»
15 years 4 months ago
Controlled random access MAC for network utility maximization in wireless networks
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
Robert J. McCabe, Nikolaos M. Freris, P. R. Kumar
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
14 years 11 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
SIGGRAPH
1996
ACM
15 years 1 months ago
A Cellular Texture Basis Function
Solid texturing is a powerful way to add detail to the surface of rendered objects. Perlin's "noise" is a 3D basis function used in some of the most dramatic and us...
Steven Worley