Sciweavers

7228 search results - page 440 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIGGRAPH
1993
ACM
15 years 11 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
15 years 10 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
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
16 years 1 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
16 years 1 days ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
SPAA
2010
ACM
15 years 11 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha