Sciweavers

562 search results - page 109 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 3 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
INFOCOM
2011
IEEE
13 years 4 days ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...
TOG
2010
89views more  TOG 2010»
13 years 3 months ago
Volumetric modeling with diffusion surfaces
The modeling of volumetric objects is still a difficult problem. Solid texture synthesis methods enable the design of volumes with homogeneous textures, but global features such a...
Kenshi Takayama, Olga Sorkine, Andrew Nealen, Take...
TMC
2010
138views more  TMC 2010»
13 years 6 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
SIGIR
2006
ACM
14 years 2 months ago
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
Memory-based methods for collaborative filtering predict new ratings by averaging (weighted) ratings between, respectively, pairs of similar users or items. In practice, a large ...
Jun Wang, Arjen P. de Vries, Marcel J. T. Reinders