Sciweavers

118 search results - page 22 / 24
» soda 2008
Sort
View
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
11 years 8 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 3 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
INFOCOM
2008
IEEE
14 years 15 hour ago
Sensor-Aided Overlay Deployment and Relocation for Vast-Scale Sensor Networks
—The overlay-based network architecture has been recognized as an effective way to deal with the funneling effect in sensor networks, where sensors closer to the sink are usually...
Guanqun Yang, Bin Tong, Daji Qiao, Wensheng Zhang
AR
2008
188views more  AR 2008»
13 years 5 months ago
Intentional Control for Planetary Rover SRR
Intentional behavior is a basic property of intelligence and it incorporates the cyclic operation of prediction, testing by action, sensing, perceiving, and assimilating the exper...
Robert Kozma, Terry Huntsberger, Hrand Aghazarian,...
DAS
2008
Springer
13 years 7 months ago
A Comparison of Clustering Methods for Word Image Indexing
In this paper we explore the effectiveness of three clustering methods used to perform word image indexing. The three methods are: the Self-Organazing Map (SOM), the Growing Hiera...
Simone Marinai, Emanuele Marino, Giovanni Soda