Sciweavers

4894 search results - page 677 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
IJCNN
2006
IEEE
15 years 10 months ago
A Comparison between Recursive Neural Networks and Graph Neural Networks
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
Vincenzo Di Massa, Gabriele Monfardini, Lorenzo Sa...
110
Voted
IRI
2006
IEEE
15 years 10 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil
128
Voted
ISPW
2006
IEEE
15 years 9 months ago
Simulating the Structural Evolution of Software
As functionality is added to an ageing piece of software, its original design and structure tends to erode. The underlying forces which cause such degradation have been the subject...
Benjamin Stopford, Steve Counsell
WIOPT
2006
IEEE
15 years 9 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
ACCV
2006
Springer
15 years 9 months ago
Super Resolution Using Graph-Cut
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
Uma Mudenagudi, Ram Singla, Prem Kumar Kalra, Subh...