Sciweavers

2079 search results - page 376 / 416
» Research Problems in Data Warehousing
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CN
2007
117views more  CN 2007»
13 years 9 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
TKDE
2008
136views more  TKDE 2008»
13 years 9 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
EC
1998
112views ECommerce» more  EC 1998»
13 years 9 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
ICCV
2003
IEEE
14 years 11 months ago
Adaptive Dynamic Range Imaging: Optical Control of Pixel Exposures Over Space and Time
This paper presents a new approach to imaging that significantly enhances the dynamic range of a camera. The key idea is to adapt the exposure of each pixel on the image detector,...
Shree K. Nayar, Vlad Branzoi