Sciweavers

1061 search results - page 80 / 213
» Natural Selection in Relation to Complexity
Sort
View
IUI
2011
ACM
12 years 12 months ago
TellMe: learning procedures from tutorial instruction
This paper describes an approach to allow end users to define new procedures through tutorial instruction. Our approach allows users to specify procedures in natural language in t...
Yolanda Gil, Varun Ratnakar, Christian Fritz
AFRIGRAPH
2004
ACM
14 years 2 months ago
Direct HDR capture of the sun and sky
We present a technique for capturing the extreme dynamic range of natural illumination environments that include the sun and sky, which has presented a challenge for traditional h...
Jessi Stumpfel, Chris Tchou, Andrew Jones, Tim Haw...
ICALP
2010
Springer
13 years 11 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 2 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
DAC
1998
ACM
14 years 1 months ago
Synthesis of Power-Optimized and Area-Optimized Circuits from Hierarchical Behavioral Descriptions
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
Ganesh Lakshminarayana, Niraj K. Jha