Sciweavers

1604 search results - page 101 / 321
» Approximation algorithms for developable surfaces
Sort
View
ALT
2004
Springer
15 years 10 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
AAAI
1992
15 years 2 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
14 years 12 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
108
Voted
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
15 years 1 months ago
Solid height-map sets: modeling and visualization
Height maps are a very efficient surface representation, initially developed for terrain modeling and visualization. They are also present in other applications, such as mesostruc...
Paulo I. N. Santos, Rodrigo de Toledo, Marcelo Gat...
COCOA
2008
Springer
15 years 3 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth