Sciweavers

2266 search results - page 349 / 454
» Some Solutions to the Ignoring Problem
Sort
View
JMIV
2007
143views more  JMIV 2007»
15 years 6 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
CP
2007
Springer
16 years 20 days ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
ICANN
2003
Springer
15 years 11 months ago
The Acquisition of New Categories through Grounded Symbols: An Extended Connectionist Model
Abstract. Solutions to the symbol grounding problem, in psychologically plausible cognitive models, have been based on hybrid connectionist/symbolic architectures, on robotic appro...
Alberto Greco, Thomas Riga, Angelo Cangelosi
LATIN
2010
Springer
15 years 11 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
SIGCOMM
1998
ACM
15 years 10 months ago
An Active Service Framework and Its Application to Real-Time Multimedia Transcoding
Several recent proposals for an “active networks” architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range...
Elan Amir, Steven McCanne, Randy H. Katz