Sciweavers

7930 search results - page 1150 / 1586
» Greedy in Approximation Algorithms
Sort
View
IJCNN
2006
IEEE
16 years 25 days ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho
IPPS
2006
IEEE
16 years 25 days ago
Neighbourhood maps: decentralised ranking in small-world P2P networks
Reputation in P2P networks is an important tool to encourage cooperation among peers. It is based on ranking of peers according to their past behaviour. In large-scale real world ...
Matteo Dell'Amico
IRI
2006
IEEE
16 years 25 days 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
164
Voted
SIBGRAPI
2006
IEEE
16 years 25 days ago
Plausible Image Based Soft Shadows Using Occlusion Textures
This paper presents a novel image-based approach to render plausible soft shadows for complex dynamic scenes with rectangular light sources. The algorithm's performance is mo...
Elmar Eisemann, Xavier Décoret
VTC
2006
IEEE
118views Communications» more  VTC 2006»
16 years 25 days ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu
« Prev « First page 1150 / 1586 Last » Next »