Sciweavers

363 search results - page 51 / 73
» The SAT Phase Transition
Sort
View
DAC
1995
ACM
13 years 11 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
COCOON
2006
Springer
13 years 9 months ago
Creation and Growth of Components in a Random Hypergraph Process
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
Vlady Ravelomanana, Alphonse Laza Rijamamy
COLING
2008
13 years 8 months ago
When is Self-Training Effective for Parsing?
Self-training has been shown capable of improving on state-of-the-art parser performance (McClosky et al., 2006) despite the conventional wisdom on the matter and several studies ...
David McClosky, Eugene Charniak, Mark Johnson
HCI
2007
13 years 8 months ago
Reminders, Alerts and Pop-ups: The Cost of Computer-Initiated Interruptions
Responding to computer-initiated notifications requires a shift in attention that disrupts the flow of work. The degree of cost associated with resuming the original task following...
Helen M. Hodgetts, Dylan M. Jones
CSREASAM
2004
13 years 8 months ago
The Key Authority - Secure Key Management in Hierarchical Public Key Infrastructures
We model a private key's life cycle as a finite state machine. The states are the key's phases of life and the transition functions describe tasks to be done with the key...
Alexander Wiesmaier, Marcus Lippert, Vangelis Kara...