Sciweavers

14244 search results - page 2533 / 2849
» Modeling Program Predictability
Sort
View
ASIACRYPT
2008
Springer
15 years 5 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
15 years 5 months ago
A wideband hierarchical circuit reduction for massively coupled interconnects
— We develop a realizable circuit reduction to generate the interconnect macro-model for parasitic estimation in wideband applications. The inductance is represented by VPEC (vec...
Hao Yu, Lei He, Zhenyu Qi, Sheldon X.-D. Tan
COORDINATION
2006
Springer
15 years 5 months ago
Enabling Ubiquitous Coordination Using Application Sessions
Abstract. Enabling coordination among ubiquitous computing applicad resources requires programming abstractions and development tools tailored to this unique environment. This pape...
Christine Julien, Drew Stovall
157
Voted
ECML
2007
Springer
15 years 5 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari
134
Voted
DCOSS
2008
Springer
15 years 5 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
« Prev « First page 2533 / 2849 Last » Next »