Sciweavers

1536 search results - page 192 / 308
» Approximately Dominating Representatives
Sort
View
SIROCCO
1997
15 years 4 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
IJCAI
1993
15 years 4 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
146
Voted
IJCV
2006
166views more  IJCV 2006»
15 years 3 months ago
Fast Constrained Surface Extraction by Minimal Paths
A new approach performing surface extraction from 3D images under user defined geometrical constraints is presented. The constraints are introduced through boundary curves given by...
Roberto Ardon, Laurent D. Cohen
127
Voted
CAD
2004
Springer
15 years 3 months ago
Choosing consistent constraints for beautification of reverse engineered geometric models
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...
163
Voted
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 3 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...