Sciweavers

4039 search results - page 749 / 808
» A Method for Dynamic Clustering of Data
Sort
View
VC
2008
93views more  VC 2008»
14 years 11 months ago
Real-time editing and relighting of homogeneous translucent materials
Existing techniques for fast, high-quality rendering of translucent materials often fix BSSRDF parameters at precomputation time. We present a novel method for accurate rendering a...
Rui Wang 0004, Ewen Cheslack-Postava, Rui Wang 000...
SAC
2008
ACM
14 years 11 months ago
Model-driven development of component-based adaptive distributed applications
This paper introduces an approach to develop componentbased adaptive distributed applications. Our approach separates the communication and the functional aspects of a distributed...
An Phung-Khac, Antoine Beugnard, Jean-Marie Gillio...
WWW
2005
ACM
16 years 16 days ago
User-centric Web crawling
Search engines are the primary gateways of information access on the Web today. Behind the scenes, search engines crawl the Web to populate a local indexed repository of Web pages...
Sandeep Pandey, Christopher Olston
IMC
2009
ACM
15 years 6 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 4 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...