Sciweavers

2745 search results - page 262 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICML
1996
IEEE
16 years 5 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
VISUALIZATION
1998
IEEE
15 years 9 months ago
Efficient warping for architectural walkthroughs using layered depth images
This paper presents efficient image-based rendering techniques used in the context of an architectural walkthrough system. Portals (doors and windows) are rendered by warping laye...
Voicu Popescu, Anselmo Lastra, Daniel G. Aliaga, M...
ESORICS
2004
Springer
15 years 10 months ago
Portable and Flexible Document Access Control Mechanisms
We present and analyze portable access control mechanisms for large data repositories, in that the customized access policies are stored on a portable device (e.g., a smart card). ...
Mikhail J. Atallah, Marina Bykova
187
Voted
CCGRID
2010
IEEE
15 years 2 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
15 years 8 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad