Sciweavers

6142 search results - page 479 / 1229
» The Complexity of Partition Functions
Sort
View
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
TNN
2010
234views Management» more  TNN 2010»
15 years 1 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
INFOCOM
2000
IEEE
15 years 11 months ago
On Service Models for Multicast Transmission in Heterogeneous Environments
– We examine in this paper the tradeoff between application complexity, network complexity, and network efficiency. We argue that the design of the current Internet reflects a ...
Matthias Grossglauser, Jean-Chrysostome Bolot
CVPR
2006
IEEE
16 years 9 months ago
Counting Crowded Moving Objects
In its full generality, motion analysis of crowded objects necessitates recognition and segmentation of each moving entity. The difficulty of these tasks increases considerably wi...
Vincent Rabaud, Serge Belongie
CVPR
2007
IEEE
16 years 9 months ago
Scene Segmentation and Categorization Using NCuts
For video summarization and retrieval, one of the important modules is to group temporal-spatial coherent shots into high-level semantic video clips namely scene segmentation. In ...
Yanjun Zhao, Tao Wang, Peng Wang, Wei Hu, Yangzhou...